Paper 2011/572 Original: eprint.iacr.org/2011/572 ↗
The ElGamal cryptosystem over circulant matrices
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
- Preprint.
- History
- 2011-10-25: last updated
- 2011-10-25: published
- Short URL
- https://ia.cr/2011/572
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/572,
author = {Ayan Mahalanobis},
title = {The ElGamal cryptosystem over circulant matrices},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/572},
year = {2011},
url = {https://eprint.iacr.org/2011/572}
}