You are looking at a specific version 20111025:170320 of this paper.
See the latest version.
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
-
CC BY
