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 problems
have a lot of high
frequencies.
Cheers,
OM
On 8/28/06, Dave Korn [EMAIL PROTECTED] wrote:
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
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
Len Sassaman wrote:
On Thu, 24 Aug 2006, Ondrej Mikle wrote:
I also have no question, personally, that if there's a backdoor in PGP,
neither Mr. Callas nor any of the PGP engineers I had the pleasure to work
with know of it. Your theory is indeed wild, and though I don't mean to
discourage
Hello.
We discussed with V. Klima about the recent bug in PGPdisk that
allowed extraction of key and data without the knowledge of passphrase.
The result is a *very*wild*hypothesis*.
Cf. http://www.safehack.com/Advisory/pgp/PGPcrack.html
Question 1: why haven't anybody noticed in three
Hello.
I humbly say that I *might* have devised a provably secure cryptosystem
that actually *might* work in reality. It provides secure authentication
and possibly might be extended to something else. Sounds too good to be
true? Well, you're right. In reality it's a bit more complicated.
Max A. wrote:
Hello!
Could anybody familiar with PGP products look at the following page
and explain in brief what it is about and what are consequences of the
described bug?
http://www.safehack.com/Advisory/pgp/PGPcrack.html
It seemed a bit obscure to me at first, but it says basically:
Travis H. wrote:
On 7/11/06, Zooko O'Whielacronx [EMAIL PROTECTED] wrote:
I hope that the hash function designers will be aware that hash
functions are being used in more and more contexts outside of the
traditional digital signatures and MACs. These new contexts include
filesystems like ZFS
David Wagner wrote:
The algorithm is very simple:
1. Choose a big random value x from some very broad range
(say, {1,2,..,N^2}).
2. Pick a random element g (mod N).
3. Compute y = g^x (mod N).
4. Ask for the discrete log of y to the base g, and get back some
answer x' such that y = g^x' (mod
Charlie Kaufman wrote:
I believe this has been known for a long time, though I have never seen the
proof. I could imagine constructing one based on quadratic sieve.
I believe that a proof that the discrete log problem is polynomially reducible
to the factorization problem is much harder and
Hello.
I believe I have the proof that factorization of N=p*q (p, q prime) is
polynomially reducible to discrete logarithm problem. Is it a known fact
or not? I searched for such proof, but only found that the two problems
are believed to be equivalent (i.e. no proof).
I still might have
helps a bit against static precomputed hashes and techniques
like rainbow tables.
Ondrej Mikle
-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]
...).
Ondrej Mikle
-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]
13 matches
Mail list logo
