On 8/28/06, Dave Korn <[EMAIL PROTECTED]> wrote:
The author has made the *exact* same error as when someone comes up with a
magical compression algorithm that they say can compress absolutely any data
down to a tiny size. They always get the data to compress, sure, but they
always have problem
From: Ross Anderson <[EMAIL PROTECTED]>
Subject: Ross' Book now online
To: [EMAIL PROTECTED]
Date: Fri, 25 Aug 2006 18:17:30 +0100
I finally managed to persuade Wiley to let me put "Security Engineering"
online for free download:
http://www.cl.cam.ac.uk/~rja14/book.html
Some of the chapters
On 28 August 2006 15:30, Ondrej Mikle wrote:
> Ad. compression algorithm: I conjecture there exists an algorithm (not
> necessarily *finite*) that can compress large numbers
> (strings/files/...) into "small" space, more precisely, it can
> compress number that is N bytes long into O(P(log N)) byt
At 15:03 + 2006/08/28, D. J. Bernstein wrote:
You left the rump session too early, Greg! What you saw was my first
presentation, which was scheduled for 0 minutes, slideless, and titled
``FFT-based acoustic side-channel analysis of piano keystrokes''; Stuart
wasn't even supposed to announce
We are both talking about the same thing :-)
I am not saying there is a finite deterministic algorithm to compress
every string into "small space", there isn't. BTW, thanks for "There
is ***NO*** way round the counting theory." :-)
All I wanted to say is:
For a specific structure (e.g. movie, pi
On 28 August 2006 17:12, Ondrej Mikle wrote:
> We are both talking about the same thing :-)
Oh!
> I am not saying there is a finite deterministic algorithm to compress
> every string into "small space", there isn't. BTW, thanks for "There
> is ***NO*** way round the counting theory." :-)
>
>
At the evening rump session at Crypto last week, Daniel Bleichenbacher
gave a talk showing how it is possible under some circumstances to
easily forge an RSA signature, so easily that it could almost be done
with just pencil and paper. This depends on an implementation error,
a failure to check a
Dave Korn wrote:
Of course, I could point out that there is precisely *1* bit of information
in that huge GIF, so even compressing it to 35 bytes isn't a great
achievement... it's one of the set of less-common inputs that grow bigger as a
compromise so that real pictures, which tend to have at
On 8/23/06, Dave Korn <[EMAIL PROTECTED]> wrote:
Given that, whatever passphrase you use, you will decrypt the EDK block and
get /something/ that looks like a key, this comparison of hashes is a sanity
test. If you bypass it but enter the wrong passphrase, you'll get an
incorrectly-decrypted E
On 8/23/06, Ondrej Mikle <[EMAIL PROTECTED]> wrote:
We discussed with V. Klima about the "recent" bug in PGPdisk that
allowed extraction of key and data without the knowledge of passphrase.
I skimmed the URL and it appears this claim was answered several times
in the original thread. Did you n
On Mon, 28 Aug 2006, Travis H. wrote:
> On 8/23/06, Alexander Klimov <[EMAIL PROTECTED]> wrote:
> > A random bit stream should have two properties: no bias and no
> > dependency between bits. If one has biased but independent bits he
> > can use the von Neumann algorithm to remove the bias, but if
On 8/29/06, Alexander Klimov <[EMAIL PROTECTED]> wrote:
Well, it not really a claim since there was no definition, here it is:
A ``dependency stripping'' algorithm is a deterministic algorithm that
gets a stream of unbiased (but not necessary independent bits) and
produces a stream of several ind
12 matches
Mail list logo
