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