paper

On the algebraic structure of and applications to cryptography

arXiv:1810.02964 · doi:10.1007/s00200-019-00410-1

Abstract

In this paper we show that the -module structure of the ring is isomorphic to a -submodule of the matrix ring over . Using this intrinsic structure of , solving a linear system over becomes computationally equivalent to solving a linear system over . As an application we break the protocol based on the Diffie-Hellman Decomposition problem and ElGamal Decomposition problem over . Our algorithm terminates in a provable running time of -operations.

To appear in Applicable Algebra in Engineering, Communication and Computing