UPDF AI

Integer Factoring Using Small Algebraic Dependencies

Manindra Agrawal,Nitin Saxena,S. Srivastava

2016 · DOI: 10.4230/LIPIcs.MFCS.2016.6
International Symposium on Mathematical Foundations of Computer Science · 2 Citations

TLDR

The AKS primality test (2004) ideas for integer factoring are adapted, and the algorithm is polynomial time (on number theoretic conjectures) if the authors know a small algebraic dependence between p,q.