Faster factoring of integers of a special form

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 4, 1996, Pages 489-493

  Peralta, René ^a   Okamoto, Eiji ^b  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Computational number theory; Cryptography; ESIGN; Factoring

Indexed keywords

COMPUTATIONAL NUMBER THEORY; FACTORING; INTEGERS;

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ERRORS; NUMBER THEORY; POLYNOMIALS; PROBABILITY; VECTORS;

ALGORITHMS;

EID: 0030123384     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. N. Alon, O. Goldreich, J. Hastad, and R. PeraltaSimple constructions of almost k-wise independent random variables Random Structures and Algorithms, vol.3, pp.289-304, 1992.
2. E. BachRealistic analysis of some randomized algorithms Journal of Computer and System Sciences, vol.42, pp.30-53, 1991.
3. E. Bach and R. PeraltaAsymptotic semi-smoothness probabilities Tech. Rep. 1115 University of Wisconsin-Madison 1992. (to appear in Mathematics of Computation).
4. I. DamgårdOn the randomness of Legendre and Jacobi sequences In Advances in Cryptology-Proceedings of CRYPTO 88, Lecture Notes in Computer Science, Springer-Verlag, pp. 163-172, 1989.
5. A. Fujioka, T. Okamoto, and S. MiyaguchiESIGN: An efficient digital signature implementation for smart cards In Advances in Cryptology-Proceedings of EUROCRYPT 91, pp.446-457, 1991.
6. A. Lenstra and H.W. Lenstra, Jr., Eds.The development of the number field sieve vol.1554 of Lecture Notes in Mathematics Springer-Verlag, 1993.
7. H.W. LenstraFactoring integers with elliptic curves Annals of Mathematics, vol.126, pp.649-673, 1987.
8. P.L. MontgomerySpeeding the Pollard and elliptic curve methods of factorization Mathematics of Computation, vol.48, pp.243-264, 1987.
9. P.L. Montgomery and R.D. SilvermanAn FFT extension to the p-1 factoring algorithm Mathematics of Computation, vol.54, pp.839-854, 1990.
10. J. Naor and M. NaorSmall-bias probability spaces: efficient constructions and applications Proc. the 22th Annual ACM Symposium on the Theory of Computing, pp.213-223, 1990.
11. n Advances in Cryptology-Proceedings of CRYPTO 92, vol.740 of Lecture Notes in Computer Science, pp.54-65, 1993.
12. R. PeraltaOn the distribution of quadratic residues and nonresidues modulo a prime number Mathematics of Computation, vol.58, pp.433-440, 1992.
13. J.M. PollardA monte carlo method for factorization BIT, vol.15, pp.331-334, 1975.
14. C. PomeranceThe quadratic sieve factoring algorithm In Advances in Cryptology-Proceedings of EUROCRYPT 84, vol.209 of Lecture Notes in Computer Science, pp.169-182, Springer-Verlag, 1985.