An improved Monte Carlo factorization algorithm
- 1 June 1980
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 20 (2), 176-184
- https://doi.org/10.1007/bf01933190
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The complexity of finding periodsPublished by Association for Computing Machinery (ACM) ,1979
- 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
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974
- A design for a number theory package with an optimized trial division routineCommunications of the ACM, 1974
- Class number, a theory of factorization, and generaPublished by American Mathematical Society (AMS) ,1971