Speeding up prime number generation
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 440-449
- https://doi.org/10.1007/3-540-57332-1_37
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The probability that a random probable prime is compositeMathematics of Computation, 1989
- Factoring with cyclotomic polynomialsMathematics of Computation, 1989
- The generation of random numbers that are probably primeJournal of Cryptology, 1988
- Recognizing primes in random polynomial timePublished by Association for Computing Machinery (ACM) ,1987
- On the number of false witnesses for a composite numberMathematics of Computation, 1986
- On the distribution of pseudoprimesMathematics of Computation, 1981
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980