Authors: N. A. Moldovyan, A. A. Moldovyan,
Şcerbacov Victor
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.
N. A. Moldovyan
St. Petersburg Institute for Informatics and Automation
of Russian Academy of Sciences
14 Liniya, 39, St.Petersburg, 199178
Russia
E-mail:
A. A. Moldovyan
ITMO University
Kronverksky pr., 10, St.Petersburg, 197101
Russia
E-mail:
V. A. Shcherbacov
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
Academiei str. 5, MD−2028 Chisinau
Moldova
E-mail:
Fulltext

–
0.08 Mb