Re: Hey - Livermore knows how to crack 3DES!
From: Ernst Lippe (ernstl-at-planet-dot-nl_at_ignore.this)
Date: 06/26/03
- Next message: Anton Stiglic: "Re: Possible problem with hash?"
- Previous message: Henrick Hellström: "Re: secret sharing / voting"
- In reply to: Paul J Gans: "Re: Hey - Livermore knows how to crack 3DES!"
- Next in thread: Volker Hetzer: "Re: Hey - Livermore knows how to crack 3DES!"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 26 Jun 2003 17:27:11 +0200
On Wed, 25 Jun 2003 22:16:48 +0000, Paul J Gans wrote:
> Well, someone who knows a mathematician at a major university
> told me that he's heard that they can factor large numbers in
> linear time.
But the fact that you can factor a number n in O(n) time
was already known in ancient Greece.
Reducing the running time to O(log n) is of course
more difficult.
greetings,
Ernst Lippe
- Next message: Anton Stiglic: "Re: Possible problem with hash?"
- Previous message: Henrick Hellström: "Re: secret sharing / voting"
- In reply to: Paul J Gans: "Re: Hey - Livermore knows how to crack 3DES!"
- Next in thread: Volker Hetzer: "Re: Hey - Livermore knows how to crack 3DES!"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]