[4272] in cryptography@c2.net mail archive
Re: RSA Test
daemon@ATHENA.MIT.EDU (Enzo Michelangeli)
Wed Mar 3 20:16:05 1999
From: "Enzo Michelangeli" <em@who.net>
To: <cryptography@c2.net>, <coderpunks@toad.com>
Date: Thu, 4 Mar 1999 08:28:56 +0800
-----Original Message-----
From: EKR <ekr@rtfm.com>
Date: Thursday, March 04, 1999 1:18 AM
Subject: Re: RSA Test
>Uh, no, definitely. You need (1) a good PRNG and (2) a reasonable
>primality tester. These are both tricky. Especially the PRNG.
BTW, a paper contributed to the IEEE P1363 Working Group by Preda Mihailescu
(http://grouper.ieee.org/groups/1363/addendum.html#Mihailescu) suggests a
technique for generating provable primes for cryptographical use, in
alternative to probabilistic primality tests.
Enzo
