--- "Major Variola (ret)" <[EMAIL PROTECTED]> wrote:
> Can someone explain how finding regularity in the
> distribution of primes
>
> would affect any modexp() system? Suppose that you
> have a function
> F(i) which gives you the i-th prime. Since the PK
> systems (eg RSA, DH)
> use *randomn
--- begin forwarded text
Date: Fri, 10 Sep 2004 11:40:08 -0400
From: Victor Duchovni <[EMAIL PROTECTED]>
To: "R. A. Hettinga" <[EMAIL PROTECTED]>
Cc: [EMAIL PROTECTED]
Subject: Re: Perplexing proof
Mail-Followup-To: "R. A. Hettinga" <[EMAIL PROTECTED]>
At 08:23 AM 9/10/04 -0400, R. A. Hettinga wrote:
><http://www.vnunet.com/print/1157970>
> Perplexing proof
>
>E-commerce is only one mathematical breakthrough away from disaster
>Robert Valpuesta, IT Week 09 Sep 2004
>
>The fact that even experts often do not fully under
<http://www.vnunet.com/print/1157970>
Perplexing proof
E-commerce is only one mathematical breakthrough away from disaster
Robert Valpuesta, IT Week 09 Sep 2004
The fact that even experts often do not fully understand how IT systems
work was underlined by recent reports that the R
