Cryptanalysis of the DHDP and EGDP protocols over E_p^(m)

10/06/2018

∙

by   Karan Khathuria, et al.

∙

0

∙

share

In this paper we break the protocol based on the Diffie-Hellman Decomposition problem and ElGamal Decomposition problem over the matrix ring E_p^(m). Our attack terminates in a provable running time of O(m^10).