v1v2 (latest)
On the algebraic structure of and applications to
cryptography

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.
View on arXivComments on this paper