Evaluation and comparison of two efficient probabilistic primality testing algorithms
- 1 September 1980
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 12 (1) , 97-108
- https://doi.org/10.1016/0304-3975(80)90007-9
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Schnelle Multiplikation großer ZahlenComputing, 1971
- On Composite Numbers P Which Satisfy the Fermat Congruence a P-1 ≡1 mod PThe American Mathematical Monthly, 1912