Research of usage possibility and post-quantum algorithms advantages depend on application conditions
Abstract
We established the need for comparative analysis and evaluation of the possibility to use asymmetric post-quantum cryptographic mechanisms. In order to compare, a procedure for evaluation was selected based on integral assessments of unconditional and conditional criteria. An analysis was conducted among the algorithms that fulfilled general unconditional criteria. As conditional criteria, we chose numerical characteristics of algorithms. In addition, additional unconditional criteria were put forward that differed depending on the conditions of use. The relevance of present research is associated with the emergence of a quantum computer. Previous studies have already proved that the existing cryptographic algorithms are vulnerable to the methods of quantum cryptanalysis. That is why, at present, leading organizations in the standardization of crypto algorithms conduct research and comparisons for selecting the post-quantum standard of cryptography. As a result of present research, we found a lack of a universal post-quantum cryptographic algorithm. It is proposed to separate three variants in the application of post-quantum algorithms: for lightweight cryptography, for the use by standard automated systems and use in a cloud-based environment. For all conditions of use, a separate evaluation of benefits in the cryptographic algorithms was carried out. Deficiencies in the leading candidate were detected. That is why the recommendations were given to employ these algorithms as the basic ones in the transition period. And, if the suspicion is confirmed, then we proposed alternatives. Results of present research allow us to understand current state in the development of post-quantum crypto algorithms and to predict their possible further development. The practical value of the research consists in obtaining the evaluation for post-quantum algorithms, depending on the conditions of their application.
Downloads
References
Shor P. W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / P. W. Shor // SIAM J. Comput. – 1997. – Issue 26 (5). – P. 1484 – 1509.
Grover L. K. A fast quantum mechanics algorithm for database search / L. K. Grover [Electronic Resource]. – Way of access: http://cds.cern.ch/record/304210/files/9605043.pdf. - Title from the screen.
Moody D. Post-Quntum Cryptography: NIST’s Plan for the Future / D. Moody // The Seventh International Conference on Post-Quntum Cryptography, Japan, 2016 [Electronic Resource]. – Way of access: https://pqcrypto2016.jp/data/ pqc2016_nist_announcement.pdf. - Title from the screen.
Mosca M. Setting the Scene for the ETSI Quantum-safe Cryptography Workshop / M. Mosca // E-proceedings of “1st Quantum-Safe-Crypto Workshop”, Sophia Antipolis, Sep 26-27, 2013 [Electronic Resource]. – Way of access: http://docbox.etsi.org/Workshop/2013/201309_CRYPTO/eproceedings_Crypto_2013.pdf. - Title from the screen.
Jao D. Isogeny-Based Quantum-Resistant Undeniable Signatures / D. Jao, V. Soukharev // PQCrypto 2014. – P. 160–179.
Postkvantova kryptografija ta mehanizmy i'i' realizacii' / I.D. Gorbenko, O.O.Kuznjecov, O.V.Potij ta in. // Radiotehnika. – 2016. – Vyp. 186. – S. 32–52.
Gorbenko Ju.I. Metody pobuduvannja ta analizu, standartyzacija ta zastosuvannja kryptografichnyh system / Ju. I. Gorbenko: monografija; za zag. red. I. D. Gorbenko. – Harkiv: Fort, 2015. – 959 s.
Lenstra H. W. Analysis and comparison of some integer factoring algorithms, in Computational Methods in Number Theory / H. W. Lenstra, Jr. Tijdeman, R. Tijdeman // Math. Centre Tract 154. – 1982. – Р. 89–141.
Yesina M. Methods of cryptographic primitives comparative analysis / Maryna Yesina, Yurij Gorbenko // Inżynier XXI wieku (“Engineer of XXI Century”): the VI Inter University Conference of Students, PhD Students and Young Scientists; University of Bielsko-Biala, Poland, December 02, 2016. – Bielsko-Biała: Wydawnictwo Naukowe Akademii Techniczno-Humanistycznej w Bielsku-Białej, 2016. – P. 451–462.
Nogin V. D. Uproshchennyi variant metoda analiza ierarkhii na osnove nelineinoi svertki kriteriev / V. D. Nogin [Elektronnyi resurs]. – Rezhim dostupa: http://www.apmath.spbu.ru/ru/staff/nogin/nogin_p11.pdf. – Zagl. s ekrana.
Ekspertnye otsenki pri razrabotke reshenii [Elektronnyi resurs]. – Rezhim dostupa: http://books.ifmo.ru/file/pdf/817.pdf – 20.05.2016. – Zagl. s ekrana.
Wang H. An efficient quantum meet-in-the-middle attack against NTRU-2005 / H. Wang, M. Zhi, M. ChuanGui // Chinese Science Bulletin. – 2013. – Vol. 58. – № 28–29. – Р. 3514–3518.
An Improved MITM Attack Against NTRU / Zhijian Xiong, Jinshuang Wang, Yanbo Wang et al. // International Journal of Security and Its Applications. – 2012. – Vol. 6. – № 2. – P. 269–274.
