Paper 2014/291

Trial multiplication is not optimal but... On the symmetry of finite cyclic groups (Z/pZ)∗

Antonio Sanso

Abstract

The Discrete Logarithm Problem is at the base of the famous Diffie Hellman key agreement algorithm and many others. The key idea behind Diffie Helmann is the usage of the Discrete Logarithm function in (Z/pZ)∗ as a trap door function. The Discrete Logarithm function output in (Z/pZ)∗ seems to escape to any attempt of finding some sort of pattern. Nevertheless some new characterization will be introduced together with a novel and more efficient trial multi- plication algorithm.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
discrete logarithm problem
Contact author(s)
antonio sanso @ gmail com
History
2014-04-30: revised
2014-04-29: received
See all versions
Short URL
https://ia.cr/2014/291
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/291,
      author = {Antonio Sanso},
      title = {Trial multiplication is not optimal but... On the symmetry of finite cyclic groups (Z/pZ)∗},
      howpublished = {Cryptology ePrint Archive, Paper 2014/291},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/291}},
      url = {https://eprint.iacr.org/2014/291}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.