Welcome to the resource topic for 2011/572
Title:
The ElGamal cryptosystem over circulant matrices
Authors: 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.
ePrint: https://eprint.iacr.org/2011/572
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .