|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2017, Number 3, Pages 115–119
(Mi basm458)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Post-quantum no-key protocol
N. A. Moldovyana, A. A. Moldovyanb, V. A. Shcherbacovc a St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, 14 Liniya, 39, St. Petersburg, 199178 Russia
b ITMO University, Kronverksky pr., 10, St. Petersburg, 197101 Russia
c Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Academiei str. 5, MD-2028 Chişinău, Moldova
Abstract:
There is proposed three-pass no-key protocol that is secure to hypothetic attacks based on computations with using quantum computers. The main operations are multiplication and exponentiation in finite ground field $GF(p)$. Sender and receiver of secret message also use representation of some value $c\in GF(p)$ as product of two other values $R_1\in GF(p)$ and $R_2\in GF(p)$ one of which is selected at random. Then the values $R_1$ and $R_2$ are encrypted using different local keys.
Keywords and phrases:
post-quantum cryptography, computationally difficult problem, conjugacy search problem, discrete logarithm, commutative encryption, no-key protocol.
Received: 15.07.2017
Citation:
N. A. Moldovyan, A. A. Moldovyan, V. A. Shcherbacov, “Post-quantum no-key protocol”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2017, no. 3, 115–119
Linking options:
https://www.mathnet.ru/eng/basm458 https://www.mathnet.ru/eng/basm/y2017/i3/p115
|
Statistics & downloads: |
Abstract page: | 254 | Full-text PDF : | 63 | References: | 39 |
|