The discrete logarithm problem in the group of non-singular circulant matrices
Cryptography and Security
2009-09-21 v2 Discrete Mathematics
Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.0905.3135,
title = {The discrete logarithm problem in the group of non-singular circulant matrices},
author = {Ayan Mahalanobis},
journal= {arXiv preprint arXiv:0905.3135},
year = {2009}
}