Factoring Small to Medium Size Integers: An Experimental Comparison

Preprint English OPEN
Milan , Jérôme;
(2010)
  • Publisher: HAL CCSD
  • Subject: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] | CFRAC | [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT] | [ MATH.MATH-NT ] Mathematics [math]/Number Theory [math.NT] | Integer factorization | SQUFOF | [ INFO.INFO-CR ] Computer Science [cs]/Cryptography and Security [cs.CR] | SIQS | ECM

Fixed a stupid but glaring mistake in the description of the ECM algorithm.; We report on our experiments in factoring integers from 50 to 200 bit with the NFS postsieving stage or class group structure computations as potential applications. We implemented, with carefu... View more
  • References (21)
    21 references, page 1 of 3

    1. B. Carrier and S. S. Wagsta , Jr. Implementing the hypercube quadratic sieve with two large primes. In International Conference on Number Theory for Secure Communications, pages 51{64, december 2003.

    2. D. J. Bernstein. How to nd smooth parts of integers, 2004. http://cr.yp.to/ papers/sf.pdf.

    3. J.F. Biasse. Improvements in the computation of ideal class groups of imaginary quadratic number elds. Submitted to Advances in Mathematics of Computation, 2009.

    4. D. Boneh. Twenty years of attacks on the rsa cryptosystem. Notices of the AMS, 46:203{213, 1999.

    5. R. Brent. Some Integer Factorization Algorithms using Elliptic Curves. Report CMA-R32-85, The Australian National University, 1985.

    6. J. Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number elds. In Seminaire de Theorie des Nombres, Paris 1988{1989, Progress in Mathematics, pages 27{41. Birkhauser, 1990.

    7. S. Contini. Factoring integers with the self-initializing quadratic sieve, 1997. http: //citeseer.ist.psu.edu/contini97factoring.html.

    8. T. Kleinjung et al. Factorization of a 768-bit rsa modulus. Cryptology ePrint Archive, Report 2010/006, 2010. http://eprint.iacr.org/2010/006.pdf.

    9. J. E. Gower and S. S. Wagsta Jr. Square form factorization. Mathematics of Computation, May 2007.

    10. Jr. H. W. Lenstra. Factoring Integers with Elliptic Curves. Annals of Mathematics, 126:649{673, January 1987.

  • Related Research Results (1)
  • Metrics
Share - Bookmark