Re: RSA Test

New Message Reply About this list Date view Thread view Subject view Author view

Enzo Michelangeli (em@who.net)
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


New Message Reply About this list Date view Thread view Subject view Author view

 
All trademarks and copyrights are the property of their respective owners.

Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:49