Paper 2009/190 Original: eprint.iacr.org/2009/190 ↗
The discrete logarithm problem in the group of non-singular circulant matrices
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2009-05-21: last updated
- 2009-05-04: published
- Short URL
- https://ia.cr/2009/190
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/190,
author = {Ayan Mahalanobis},
title = {The discrete logarithm problem in the group of non-singular circulant matrices},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/190},
year = {2009},
url = {https://eprint.iacr.org/2009/190}
}