On distinguishing prime numbers from composite numbers
- 1 October 1980
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (02725428), 387-406
- https://doi.org/10.1109/sfcs.1980.28
Abstract
A new algorithm for testing primality is presented. The algorithm is distinguishable from the lovely algorithms of Solvay and Strassen [36], Miller [27] and Rabin [32] in that its assertions of primality are certain (i.e., provable from Peano's axioms) rather than dependent on unproven hypothesis (Miller) or probability (Solovay-Strassen, Rabin). An argument is presented which suggests that the algorithm runs within time c1ln(n)c2ln(ln(ln(n))) where n is the input, and C1, c2 constants independent of n. Unfortunately no rigorous proof of this running time is yet available.Keywords
This publication has 21 references indexed in Scilit:
- Popular values of Euler's functionMathematika, 1980
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Reducibility, randomness, and intractibility (Abstract)Published by Association for Computing Machinery (ACM) ,1977
- NP-complete decision problems for quadratic polynomialsPublished by Association for Computing Machinery (ACM) ,1976
- Computational complexity of probabilistic Turing machinesPublished by Association for Computing Machinery (ACM) ,1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Factoring Polynomials Over Large Finite FieldsMathematics of Computation, 1970
- Book Review: Slatistical independence in probability, analysis and number theoryBulletin of the American Mathematical Society, 1960