Quantum Attacks on IFP-Based Cryptosystems
Reference90 articles.
1. L.M. Adleman, Algorithmic number theory – the complexity contribution, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (IEEE, New York, 1994), pp. 88–113
2. L.M. Adleman, J. DeMarrais, M.D.A. Huang, Quantum computability. SIAM J. Comput. 26(5), 1524–1540 (1997)
3. M. Agrawal, N. Kayal, N. Saxena, Primes is in P. Ann. Math. 160(2), 781–793 (2004)
4. D. Atkins, M. Graff, A.K. Lenstra, P.C. Leyland, The magic words are Squeamish Ossifrage, in Advances in Cryptology – ASIACRYPT’94. Lecture Notes in Computer Science, vol. 917 (Springer, Berlin, 1995), pp. 261–277
5. C.H. Bennett, D.P. DiVincenzo, Quantum information and computation. Nature 404, 247–255 (2000)