Paper 2011/572

The ElGamal cryptosystem over circulant matrices

Ayan Mahalanobis

Abstract

Can one use the discrete logarithm problem in matrix groups, to build a better and secure cryptosystem? We argue, it is indeed the case. This makes the group of circulant matrices suitable and attractive for lightweight cryptography.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
ayanm @ iiserpune ac in
History
2011-10-25: received
Short URL
https://ia.cr/2011/572
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/572,
      author = {Ayan Mahalanobis},
      title = {The ElGamal cryptosystem over circulant matrices},
      howpublished = {Cryptology ePrint Archive, Paper 2011/572},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/572}},
      url = {https://eprint.iacr.org/2011/572}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.