Integer Factoring Using Small Algebraic Dependencies

@inproceedings{Agrawal2016IntegerFU,
  title={Integer Factoring Using Small Algebraic Dependencies},
  author={Manindra Agrawal and Nitin Saxena and Shubham Sahai Srivastava},
  booktitle={MFCS},
  year={2016}
}
Integer factoring is a curious number theory problem with wide applications in complexity and cryptography. The best known algorithm to factor a number n takes time, roughly, exp(2 log1/3 n· log2/3 logn) (number field sieve, 1989). One basic idea used is to find two squares, possibly in a number field, that are “congruent” modulo n. Several variants of this… CONTINUE READING