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
ПРО СЛАБКІСТЬ S ПЕРЕТВОРЕННЯ ШИФРУ СТРУМОК З ЛАНЦЮЖКА КЕРОВАНИХ S-БЛОКІВ
Обговорюються особливості побудування S-перетворення шифру Струмок. Зокрема, виконано аналіз пропозиції щодо побудови S-перетворення шифру Струмок з використанням керованих S-блоків. Оцінюються показники його випадковост...
Сompilations method and semantic verification time parameterized of multiparallel programs
It provides definitions vremyaparametrizovannyh multiparallelnyh programs that (in contrast to the conventional treatment of parallel programs) contain moments of the start of operations specifications / features, as wel...
Essence and conditions of implementation of the attack based on related keys relatively electronic signatures IBS-1 and IBS-2 DSTU ISO/IEC 14888-3
The paper deals with the state of protection electronic signatures based on the pairing of points of an elliptic curve against attacks based on the signing data with related keys. It is defined conditions and possibiliti...
The selection of forming polynomials for shift register with nonlinear feedback second order that generates the sequence with maximum period
Model pseudo-random sequence generator based on shift registers with nonlinear feedback second order is considered. Additional requirements for type of polynomial are formulated. They limit the set of polynomials which g...
SYNTHESIS OF DERIVED SIGNAL SYSTEMS FOR APPLICATIONS IN MODERN INFORMATION AND COMMUNICATION SYSTEMS
The specified requirements for complex signal systems selection – data carriers for utilization in information and communication systems (ICT), with higher demand for noise immunity, noise resistance, secrecy and informa...