From The Times
August 4, 2008
Spy chief Sir David Pepper goes public about the secret life of GCHQ

<http://www.timesonline.co.uk/tol/news/uk/article4454535.ece>

How did the RAF get a Soviet helicopter?

Andrew Swallow

http://www.islamhouse.com/tag/

http://www.al-sunnah.com/philippine/ -

----------FORGERY BY ME (ARI SILVERSLIME)-------------

Ive got shit4brains. Everybody knows that.

I have at least ten ppl tuned into ACF. we love forging.

H^H^H^H^H^H^H^H^H^ HEHEHEHEHEHEH

Craig, you are helping a lot these days and I like you more. Fancy
a reach around? Somewhere in private. :)

I understand the different povs on your issue. My point is ACF has
problems with postings from other destructive people like liar
Yrrah, weenie iNcReDuLoUs, brian dead Me here, ass John
Fitzsimons, destructive Ari, MoRon May, tomfool Thip, perjuring
»Q«, stoopid elaich, big mouth dadiOH, dumb POKO, high priestess
Susan Bugher, dummie Little Luke, troublemaking Richard Feldstein,
know-nothing burnr, slimeball Franklin and a few others. half of
them are joos of course.

Katz is a Joose Bro so I won't kick his klop but(t)once. He needs
to get the fuck out of the encryption-compression biz or step up
to open source. This poor excuse for proprietary methodology sux
beeny-weenies.

He stinks with both. lol

The UK bank Barclays recently introduced a new, controversial security
system based on a card-reader called PINSentry. More information is
available e.g. here http://en.wikipedia.org/wiki/Pinsentry

I wondered if anyone knew any in-depth analysis of the device from a
cryptographic point of view. Barclays didn't release technical information
about how the system works (bad idea!) but I imagine some things can already
be inferred by the way it works.

For example, one function of this gizmo is to generate 8-digit codes to be
used to access on-line banking services. To generate one code one has to
insert one's debit card, enter the card's PIN and the press on the
"Identify" button on the card reader. This access code can also be written
down somewhere and saved for later use (i.e., these codes are not
time-sensitive). Also, note that the device is not connected to the internet
or to a computer. How this could be done?

Lorenzo

Some of the people believe in a solution to the primes set as a true
mathematical functional. I have found no evidence of it as other than
a certain unfunctional set. Unfunctional means it has a relation
cause its existence and not the function.

It is like a set of colors. A relation designer makes the set as a
cause to color chart, for example. Because a relation causes a number
a person finds a technique for discussing a set in general as the
proper definition of the prime set. A function relates a set of
number to another while relation causes number to exist. An exact
inversion of these concepts should clarify.

S as a true cause. IN set theory an effect of relation is held to
cause set existence and the, S, denoting the relation was a factor
relation only, without the functional usage. An inversion of set then
becomes possible in old Greek theory methods. Allow the f as a
functional relation of the set to the all. A correspondence was
always the idea in set theory here. An identity relation only to
allow a set of primes to relate to all primes.

S= f(p) as the set inverted. All as S was implied. All primes.

I posted a method to printout the NOT prime series as a C code a while
back.

It repeats some number though. Making it not a true mathematical
series.

I am going to try to make it a RSA cracker. So what it needs to do is
test every number printed NOT, except to factor it needs
modification. When the number equals the printout, the RSA number
that is, a maybe I am confused now. But anyways, A d needs removal
to crak rsa. Remove a d from the code and it becomes a cracker.

So I just need to remember the d to remove. Look at the code below.
It is a broken C code. BUt it runs. If k and j are primes then the
printout is an RSA factor.

SO JUst say in a priori that the number selected is a prime factor
ONLY!

Making k*j the primes!

So when factor = k*j kick out of the code.

So I will try this today. It is only a NONBIG number code though so
it can not really attack.

#include

Princeton security researchers purport successful attacks against
Microsoft Bitlocker, TrueCrypt, and other mainline disk encryption
products.

There is a video at the following URL that shows an actual attack, and
it looks to be trivial:

http://news.cnet.com/8301-1009_3-10003167-83.html

If you have a laptop and use one of these type encryption solutions,
you probably need to eyeball this one.

Maybe some closer scrutiny will show a method to prevent the attack.

Is secure to use RIPEMD-160 hash function? I know that there are not
known atacks about that algorithm, but I don't know if today is really
secure to use a hash of 160 bits.

Or if would be best to use a hash of 256 bits as minimum (as SHA-256)?
--althought has been created by N S A--

http://vault.telin.com/?dir=./public/Hash

sha256.exe

I'm going to use 95 UTF-8 characters (that occupies 2 bytes each one),
and I want to calculate its entropy for 80 bits --I think that is the
minimum recommend by NIST--.

------------------------
95 latin-1 chars. = 190 bytes

80 / lg(190 by) = 10 by (= 5 UTF-8 chars.)