Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the algebraic structure of $E_p^{(m)}$ and applications to cryptography

Published 6 Oct 2018 in cs.CR and math.NT | (1810.02964v2)

Abstract: In this paper we show that the $\mathbb Z/p{m}\mathbb Z$-module structure of the ring $E_p{(m)}$ is isomorphic to a $\mathbb Z/p{m}\mathbb Z$-submodule of the matrix ring over $\mathbb Z/p{m}\mathbb Z$. Using this intrinsic structure of $E_p{(m)}$, solving a linear system over $E_p{(m)}$ becomes computationally equivalent to solving a linear system over $\mathbb Z/p{m}\mathbb Z$. As an application we break the protocol based on the Diffie-Hellman Decomposition problem and ElGamal Decomposition problem over $E_p{(m)}$. Our algorithm terminates in a provable running time of $O(m{6})$ $\mathbb Z/p{m}\mathbb Z$-operations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.