The discrete logarithm problem in the group of non-singular circulant matrices
classification
💻 cs.CR
cs.DMcs.ITmath.IT
keywords
discretelogarithmproblemcirculantgroupmatricespublicbackbones
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.