Welcome to the resource topic for 2009/190
Title:
The discrete logarithm problem in the group of non-singular circulant matrices
Authors: 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.
ePrint: https://eprint.iacr.org/2009/190
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 .