Author:
Moldovyan Nikolay A.,Moldovyan Dmitriy N.,Moldovyan Alexander A.,Nguyen Hieu Minh,Trinh Le Hoang Tuan
Publisher
Springer International Publishing
Reference17 articles.
1. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)
2. Yan, S.Y.: Quantum Attacks on Public-Key Cryptosystems, p. 207. Springer, Heidelberg (2014). https://doi.org/10.1007/978-1-4419-7722-9
3. Smolin, J.A., Smith, G., Vargo, A.: Oversimplifying quantum factoring. Nature 499(7457), 163–165 (2013)
4. Submission Requirements and Evaluation Criteria for the Post-Quantum Cryptography Standardization Process. NIST PQCrypto project. https://csrc.nist.gov/CSRC/media/Projects/Post-Quantum-Cryptography/documents/call-for-proposals-final-dec-2016.pdf
5. First NIST standardization conference - 11–13 April 2018. http://prometheuscrypt.gforge.inria.fr/2018-04-18.pqc2018.html
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献