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.

UDC: 004.056.55

DOI: 10.17223/2226308X/10/36