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

Ayan Mahalanobis

Paper 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.

Note: Minor changes in text, new reference.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: MOR cryptosystems discrete logarithm problem circulant matrices
Contact author(s): ayanm @ iiserpune ac in
History: 2009-05-21: revised; 2009-05-04: received; See all versions
Short URL: https://ia.cr/2009/190
License: CC BY

BibTeX

@misc{cryptoeprint:2009/190,
      author = {Ayan Mahalanobis},
      title = {The discrete logarithm problem in the group of non-singular circulant matrices},
      howpublished = {Cryptology ePrint Archive, Paper 2009/190},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/190}},
      url = {https://eprint.iacr.org/2009/190}
}