|
Mathematical Methods of Cryptography
A version of the Diffie–Hellman protocol based on using additional hidden factors
A. A. Obzor Omsk State University, Omsk
Abstract:
We give a version of the classical Diffie–Hellman protocol that uses hidden factors from subgroups of the multiplicative group of the corresponding finite field. To compute a secret data of the protocol, one needs not only to solve the underlined discrete logarithm problem, but simultaneously to compute the orders of some elements of the multiplicative group.
Keywords:
cryptography, Diffie–Hellman protocol, hidden factors.
Citation:
A. A. Obzor, “A version of the Diffie–Hellman protocol based on using additional hidden factors”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 89–91
Linking options:
https://www.mathnet.ru/eng/pdma351 https://www.mathnet.ru/eng/pdma/y2017/i10/p89
|
|