Cryptology ePrint Archive: Report 2009/190

The discrete logarithm problem in the group of non-singular circulant matrices

Ayan Mahalanobis

Abstract: The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key cryptosystems.

Category / Keywords: public-key cryptography / MOR cryptosystems, discrete logarithm problem, circulant matrices

Date: received 4 May 2009, last revised 21 May 2009

Contact author: ayanm at iiserpune ac in

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: Minor changes in text, new reference.

Version: 20090521:105741 (All versions of this report)

Discussion forum: Show discussion | Start new discussion