From: patrick@Verity.COM (Patrick Horgan)
To: sjb@universe.digex.net
Message Hash: d23377fca0a4479fc1230f9277f49d29c8ad50a99de4c550bcb5c27dc3d27ed6
Message ID: <9510090031.AA02210@cantina.verity.com>
Reply To: N/A
UTC Datetime: 1995-10-09 00:34:48 UTC
Raw Date: Sun, 8 Oct 95 17:34:48 PDT
From: patrick@Verity.COM (Patrick Horgan)
Date: Sun, 8 Oct 95 17:34:48 PDT
To: sjb@universe.digex.net
Subject: Re: subjective names and MITM
Message-ID: <9510090031.AA02210@cantina.verity.com>
MIME-Version: 1.0
Content-Type: text/plain
> From: Scott Brickner <sjb@universe.digex.net>
>
> Patrick Horgan writes:
> >Given the difficulty of finding primes, how likely do you think it is that
> >given one of the well known methods and finding the first 1024 bit prime
> >that pops out would give you an effective attack?
>
> I'm not an expert here, but I understand the "well-known methods" to
> essentially use some formula that "tends" to generate prime numbers from
> uniformly distributed numbers, feed it a "good" random number, and then
> check to see if it's really prime. If it's not, pick another "good"
> random number and try again. The entropy in the prime is the same
> as in the random number generator.
>
Can someone give me pointers to literature on this? Books prefered.
Patrick
_______________________________________________________________________
/ These opinions are mine, and not Verity's (except by coincidence;). \
| (\ |
| Patrick J. Horgan Verity Inc. \\ Have |
| patrick@verity.com 1550 Plymouth Street \\ _ Sword |
| Phone : (415)960-7600 Mountain View \\/ Will |
| FAX : (415)960-7750 California 94303 _/\\ Travel |
\___________________________________________________________\)__________/
Return to October 1995
Return to “patrick@Verity.COM (Patrick Horgan)”
1995-10-09 (Sun, 8 Oct 95 17:34:48 PDT) - Re: subjective names and MITM - patrick@Verity.COM (Patrick Horgan)