  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.
