RUS  ENG
Полная версия
ЖУРНАЛЫ // Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica // Архив

Bul. Acad. Ştiinţe Repub. Mold. Mat., 2017, номер 3, страницы 115–119 (Mi basm458)

Эта публикация цитируется в 1 статье

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

Аннотация: 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.

Ключевые слова и фразы: post-quantum cryptography, computationally difficult problem, conjugacy search problem, discrete logarithm, commutative encryption, no-key protocol.

MSC: 94A60, 11S05

Поступила в редакцию: 15.07.2017

Язык публикации: английский



© МИАН, 2024