1994-08-30 - Knuth Volume 2 Page 379
Header Data
From: trollins@debbie.telos.com (Tom Rollins)
To: N/A
Message Hash: cadbbe25dbca2613838a95fb964c58f6b5dd6b148b34df09a66731fc00faf6ce
Message ID: <9408301936.AA12752@debbie.telos.com>
Reply To: N/A
UTC Datetime: 1994-08-30 19:37:15 UTC
Raw Date: Tue, 30 Aug 94 12:37:15 PDT
Raw message
From: trollins@debbie.telos.com (Tom Rollins)
Date: Tue, 30 Aug 94 12:37:15 PDT
Subject: Knuth Volume 2 Page 379
Message-ID: <9408301936.AA12752@debbie.telos.com>
MIME-Version: 1.0
Content-Type: text/plain
Hello,
I have a little question about some math algorithms.
People have talked in alt.security.pgp about the Miller
Test and the Miller-Rabin Test.
I am getting ready to improve PGP's testing of potential
prime numbers and have been looking for a good algorithm.
After reading some in Knuth Volume 2, I have come across
Algorithm P on page 379. Is this algorithm in fact the
Miller-Rabin Test ???
Thanks,
Tom Rollins
<trollins@debbie.telos.com>
Thread
Return to August 1994
- Return to “Karl Lui Barrus <klbarrus@owlnet.rice.edu>”
Return to “trollins@debbie.telos.com (Tom Rollins)”
- 1994-08-30 (Tue, 30 Aug 94 12:37:15 PDT) - Knuth Volume 2 Page 379 - trollins@debbie.telos.com (Tom Rollins)
- 1994-08-30 (Tue, 30 Aug 94 13:38:06 PDT) - Re: Knuth Volume 2 Page 379 - Karl Lui Barrus <klbarrus@owlnet.rice.edu>