How to Generate Factored Random Numbers
- 1 April 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (2) , 179-193
- https://doi.org/10.1137/0217012
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- Tests de primaliteTheoretical Computer Science, 1980
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Multiplicative Number TheoryPublished by Springer Nature ,1980
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Analysis of a simple factorization algorithmTheoretical Computer Science, 1976
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Fast Multiple-Precision Evaluation of Elementary FunctionsJournal of the ACM, 1976
- Problems and Theorems in AnalysisPublished by Springer Nature ,1972