Integer Factoring

  title={Integer Factoring},
  author={A. K. Lenstra},
  journal={Designs, Codes and Cryptography},
  • A. K. Lenstra
  • Published 2000
  • Mathematics, Computer Science
  • Designs, Codes and Cryptography
Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization. 

Tables and Topics from this paper

A geometric approach to integer factorization
This work gives a geometric approach to integer factorization based on special approximations of segments of the curve represented by y=n/x, where $n$ is the integer whose factorization the authors need. Expand
A log-log speedup for exponent one-fifth deterministic integer factorisation
Building on techniques recently introduced by the second author, and further developed by the first author, we show that a positive integer N may be rigorously and deterministically factored intoExpand
A Survey of Techniques Used in Algebraic and Number Theoretic Algorithms
We survey some of the important tools and techniques used in designing algorithms for problems in algebra and number theory. We focus on the computational efficiency of these tools and show how theyExpand
Computational methods in public key cryptology
These notes informally review the most common methods from computational number theory that have applications in public key cryptology.
Quantum Algorithms for Integer Factorization
If IFP can be solved in polynomial-time, then RSA and many other cryptographic systems can be broken completely and efficiently. Expand
A time-space tradeoff for Lehman's deterministic integer factorization method
This paper constructs a time-space tradeoff for Lawrence's generalization and applies it together with Lehman's result to obtain a deterministic integer factorization algorithm with runtime complexity $O(N^{2/9+o(1)})$. Expand
Factoring Based Cryptography
This chapter discusses various factoring based cryptographic systems and protocols in the context of public-key cryptography. Expand
A babystep-giantstep method for faster deterministic integer factorization
This paper combines Strassen's approach with a babystep-giantstep method to improve the currently best known bound by a superpolynomial factor. Expand
Analysis of Pollard's Rho Factoring Method
A comprehensive heuristic analysis of the Pollard’s Rho Method (PRM) is given. The analysis is based on ultimate periods and tails distribution of sequences. If n is the composite number to beExpand
A special purpose integer factorization algorithm
A special purpose factorization algorithm is proposed to find the factors of a composite number which is the product of two primes and the efficiency of the scheme is proved theoretically. Expand


An Implementation of the Elliptic Curve Integer Factorization Method
This paper describes the second author’s implementation of the elliptic curve method for the factorization of integers as it is currently available in the computational algebra package Magma, whichExpand
A monte carlo method for factorization
We describe briefly a novel factorization method involving probabilistic ideas.
A method of factoring and the factorization of
The continued fraction method for factoring integers, which was introduced by D. H. Lehmer and R. E. Powers, is discussed along with its computer implementation. The power of the method isExpand
The multiple polynomial quadratic sieve
A modification, due to Peter Montgomery, of Pomerance's Quadratic Sieve for factoring large integers is discussed along with its implementation. Using it, allows factorization with over an order ofExpand
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
We present a heuristic method for the reduction modulo 2 of a large, sparse bit matrix to a smaller, dense bit matrix that can then be solved by conventional means, such as Gaussian elimination. ThisExpand
An Implementation of the Number Field Sieve
An implementation of the NFS is described, including the choice of two quadratic polynomials, both classical sieving and a special form of lattice sieving (line sieving), the block Lanczos method and a new square root algorithm. Expand
Solving Large Sparse Linear Systems over Finite Fields
It is shown that very large sparse systems can be solved efficiently by using combinations of structured Gaussian elimination and the conjugate gradient, Lanczos, and Wiedemann methods. Expand
Theorems on factorization and primality testing
This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n or test it for primality, and uses a multi-tape Turing machine for this purpose. Expand
The lattice sieve
We describe a possible improvement to the Number Field Sieve. In theory we can reduce the time for the sieve stage by a factor comparable with log(B1). In the real world, where much factoring takesExpand
A $p+1$ method of factoring
Let N have a prime divisor p such that p + 1 has only small prime divisors. A method is described which will allow for the determination of p, given N. This method is analogous to the p — 1 method ofExpand