How to Generator Prime Numbers in a short time ?
- From: "Chen" <forchen_lc@xxxxxxxxxxx>
- Date: 10 Aug 2006 03:52:49 -0700
Hello everyone:
I want to generator a 1024-bit prime number as the key of RSA
algorithm.
At first, I set up a PrimeTable which contains 500 prime numbers
from 3 to 3259. Then I generator a random number, divided the numbers
in the PrimeTable , to see whether the random number is a
probablePrime.
If the random number passed the first test , then subjects that
number to certain tests of primality, called the Miller-Rabin and
Lucas-Lehmer tests.
After the number passed the two tests, it 99% to be a prime number.
But, the problem is , I should generator hundreds of random numbers;
then verify the numbers one by one . It takes too long to check every
numbers.
How can I generator a prime number in a short time ?
.
- Follow-Ups:
- Re: How to Generator Prime Numbers in a short time ?
- From: Tim Smith
- Re: How to Generator Prime Numbers in a short time ?
- From: Christian Siebert
- Re: How to Generator Prime Numbers in a short time ?
- From: Phil Carmody
- Re: How to Generator Prime Numbers in a short time ?
- From: Joseph Ashwood
- Re: How to Generator Prime Numbers in a short time ?
- From: jstevh
- Re: How to Generator Prime Numbers in a short time ?
- From: Mike Amling
- Re: How to Generator Prime Numbers in a short time ?
- From: Pubkeybreaker
- Re: How to Generator Prime Numbers in a short time ?
- From: Bryan Olson
- Re: How to Generator Prime Numbers in a short time ?
- From: Lutz Donnerhacke
- Re: How to Generator Prime Numbers in a short time ?
- Prev by Date: Re: Fingerprint as cryptokey
- Next by Date: Re: How to Generator Prime Numbers in a short time ?
- Previous by thread: Need simple lib for asymetric encryption
- Next by thread: Re: How to Generator Prime Numbers in a short time ?
- Index(es):
Relevant Pages
|