RESEARCH OF USAGE POSSIBILITY AND POST-QUANTUM ALGORITHMS ADVANTAGES DEPEND ON APPLICATION CONDITIONS
Journal Title: КОМП’ЮТЕРНІ НАУКИ ТА КІБЕРБЕЗПЕКА - Year 2017, Vol 3, Issue 7
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.
Authors and Affiliations
Ivan Gorbenko, Vladimir Ponomar, Maryna Yesina
A pseudorandom sequences generator based on the multimodulo transformation
Main theoretical statements and practical research results of pseudorandom sequences over arbitrary alphabet generation based on multimodulo transformation in the finite field GF(pn) are given, results of properties anal...
IMPROVED MATHEMATICAL MODEL OF THE POST-QUANTUM ELETRONIC SIGNATURE MECHANISM
In the paper new electronic signature mechanisms which will be urgent in the post-quantum period devel-opment necessity is grounded. The main one time key mechanisms are briefly described. Problems related with Lamport O...
О некоторых особенностях криптографических валют и их роли в современных финансовых системах
В работе представлена аргументация относительно места криптовалют в современной мировой финансовой системе. На основании прямых и косвенных данных показано, что криптовалюта всех видов содержит в себе определенные ри...
АВТОМАТИЗОВАНИЙ ПОШУК ВРАЗЛИВОСТЕЙ ПРОГРАМНОГО ЗАБЕЗПЕЧЕННЯ ІЗ ЗАСТОСУВАННЯМ МЕТОДІВ ГЛИБИННОГО НАВЧАННЯ
Наведено теоретичну інформацію про тестування програмного забезпечення методом фаззінгу. Розглянуто технології навчання з підкріпленням та використання інтелектуального фаззінгу в процесі тес-тування програмного забезпеч...
NTRU Prime IIT Ukraine encryption algorithm with consideration known attacks analysis
The paper deals with the modern cryptographic transformations of the asymmetric end-to-end encryption type, namely – NTRU-like cryptographic systems. A new cryptographic system NTRU Prime IIT Ukraine was created based on...