On Sun, 14 Jul 2002 15:24:48 +0200 Amir Herzberg [EMAIL PROTECTED] writes:
1. Quantum key encryption seems to require huge amounts of truly random
bits at both sender and receiver. This seems impractical as (almost) truly
random bits are hard to produce (especially at high speeds). Is there a
At 02:40 PM 7/19/02 -0400, John S. Denker wrote:
Amir Herzberg wrote:
I don't even need quantum mechanics to generate
industrial-strength random symbols.
No one is saying you do.
Specifically: The executive summary of the
principles of operation of my generator is:
-- use SHA-1, which is
At 20:50 11/07/2002, Ian wrote:
When I first read The Code Book (Simon Singh), I drooled endlessly at
the idea of Unbreakable Encryption, until I became a little more
cynical. I questioned Dr Singh on this when he came and gave a lecture
in Cheltenham UK recently, and his best answer was that
On Thu, Jul 11, 2002 at 07:50:30PM +0100, Ian Hill wrote:
Hammond said that his company, scheduled for a public launch this
September, will have a commercially available solution in 2003. The
Somerville, Massachusetts-based company is developing a prototype
quantum cryptographic device
On Mon, Jul 08, 2002 at 04:20:37PM -0400, R. A. Hettinga wrote:
Given that quantum computers will provide an enormous power boost,
encryption experts believe that current standards for encryption,
which are based on computational difficulty, will then fall. In the
world of quantum computing
On Thu, Jul 11, 2002 at 07:50:30PM +0100, Ian Hill wrote:
On Mon, Jul 08, 2002 at 04:20:37PM -0400, R. A. Hettinga wrote:
Given that quantum computers will provide an enormous power boost,
encryption experts believe that current standards for encryption,
which are based on computational
http://www.ecommercetimes.com/perl/printer/18490/
NewsFactor Network
Technology's Home Page
Quantum Computing Puts Encrypted Messages at Risk
By Tim McDonald
www.NewsFactor.com,
Part of the NewsFactor Network
July 08, 2002
http://www.newsfactor.com/perl/story/18490.html
Given that quantum
