1. L. M. Adleman and K. S. McCurley . 1994 . Open problems in number theoretic complexity, II. In Algorithmic Number Theory , First International Symposium, ANTS-I , Ithaca, NY, USA , May 6-9, 1994, Proceedings. 291–322. L. M. Adleman and K. S. McCurley. 1994. Open problems in number theoretic complexity, II. In Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings. 291–322.
2. E. Bach . 1988 . Intractable Problems in Number Theory. In Advances in Cryptology - CRYPTO ’88 , 8th Annual International Cryptology Conference , Santa Barbara, California, USA , August 21-25, 1988, Proceedings. 77–93. E. Bach. 1988. Intractable Problems in Number Theory. In Advances in Cryptology - CRYPTO ’88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings. 77–93.
3. Factor Refinement
4. Sums of Divisors, Perfect Numbers and Factoring
5. Factoring into coprimes in essentially linear time