main| new issue| archive| editorial board| for the authors| publishing house|
Русский
Main page
New issue
Archive of articles
Editorial board
For the authors
Publishing house

 

 


ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 4. Vol. 26. 2020

DOI: 10.17587/it.26.207-213

D. Yu. Guryanov, PhD, Tech., Associate Professor, e-mail: guryanov.dyu@yandex.ru, Admiral Makarov State University Maritime and Inland Shipping, Saint-Petersburg, 198035, Russian Federation, A. A. Kostina, Research Fellow of Laboratory of Information Systems Security, e-mail: to.ann@inbox.ru, N. A. Moldovyan, Dr. Sc., Tech., Professor, Chief Researcher of Laboratory of Information Systems Security, e-mail: nmold@mail.ru, St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences, Saint-Petersburg, 199178, Russian Federation

Post-Quantum Protocol for No-Key Encryption

The most widely used cryptoschemes with public key are based on computational difficulty of the factorization problem and on the discrete logarithm problem. The known no-key protocols are base on the second problem. Significant progress in the development of quantum computers for which there is known polynomial algorithm for integer factoring and for finding discrete logarithm have put forward problem of construction of the post-quantum algorithms and protocols, i.e. cryptoschemes that are secure to potential attacks using quantum computers. The paper considers a protocol no-key encryption, which is secure to attacks using quantum computers, on the base of the discrete logarithm on elliptic curve. As a method, at the first step of the protocol the sender divides the sent message into two values and encrypts each of them on independent local keys. At the second step analogous procedure is performed by the receiver over each of two received ciphertexts. As a result, it is proposed a new design of the no-key encryption protocol based on commutative encryption function, which is secure against quantum attacks. The proposed protocol is characterized in using commutative encryption on elliptic curve and dividing the encrypted value into two parts followed by encryption of each part using independent local key. The proposed protocol possesses sufficiently high performance and suites well for software and hardware implementations.
Keywords: post-quantum cryptoschemes, information protection, no-key encryption, commutative encryption, local keys, single-use keys, security, elliptic curve, computationally difficult problem

P. 207–213

To the contents