The discrete logarithm problem in the group of non-singular circulant matrices

Ayan Mahalanobis
2010 Groups - Complexity - Cryptology  
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.
doi:10.1515/gcc.2010.006 fatcat:ulq2wbrcprerrajhnqzj5633sm