Probabilistic algorithm for testing primality
- 1 February 1980
- journal article
- Published by Elsevier in Journal of Number Theory
- Vol. 12 (1), 128-138
- https://doi.org/10.1016/0022-314x(80)90084-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- On Composite Numbers P Which Satisfy the Fermat Congruence a P-1 ≡1 mod PThe American Mathematical Monthly, 1912