Old and new deterministic factoring algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1122, Issue , 1996, Pages 217-224

  McKee, James ^a   Pinch, Richard ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MONTE CARLO METHODS; NUMBER THEORY;

DISCRETE LOGARITHMS; NON-TRIVIAL; POSITIVE INTEGERS;

ALGORITHMS;

EID: 84958053958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61581-4_57     Document Type: Conference Paper

References (13)

1. Brillhart, J., Selfridge, J.L.: Some factorizations of 2n±l and related results. Math. Comp. 21 (1967) 87-96
2. Coppersmith, D.: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities, (preprint).
3. Lehman, R.S.: Factoring large integers. Math. Comp. 28 (1974) 637-646
4. Lenstra, Jr., H.W.: Divisors in residue classes. Math. Comp. 42 (1984) 331-340
5. McKee, J.F.: Turning Euler’s factoring method into a factoring algorithm. Bull. London Math. Soc. (to appear)
6. McKee, J.F.: A √q/pfactoring method, (in preparation)
7. Pollard, J.M.: Theorems on factorization and primality testing. Proc. Cambridge Phil. Soc. 76 (1974) 521-528
8. Pollard, J.M.: Monte Carlo methods for index computation (modp). Math. Comp. 32 (1978) 918-924
9. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21 (1978)
10. Schoof, R.J.: Quadratic fields and factorization. Computational Methods in Number Theory, Part II, edited by H.W. Lenstra, Jr. and R. Tijdeman, Mathematical Centre Tracts 155, Mathematisch Centrum, Amsterdam (1982)
11. Shanks, D.: Class number, a theory of factorization and genera. Proc. Symp. Pure Math. 20 AMS (1971) 415-440
12. Strassen, V.: Einige Resultate uber Berechnungskomplexitat. Jahresber. Deutsch. Math.-Verein. 78 (1976/77) 1-8
13. Turk, J.W.M.: Fast arithmetic operations on numbers and polynomials. Computational Methods in Number Theory, Part I, edited by H.W. Lenstra, Jr. and R. Tijdeman, Mathematical Centre Tracts 154, Mathematisch Centrum, Amsterdam (1982)