Cryptology ePrint Archive: Report 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.

Category / Keywords: discrete logarithm problem

Date: received 25 Apr 2014, last revised 30 Apr 2014

Contact author: antonio sanso at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20140430:142018 (All versions of this report)

Short URL: ia.cr/2014/291

Discussion forum: Show discussion | Start new discussion