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

From MaRDI portal
Publication:3585200

DOI10.1515/GCC.2010.006zbMATH Open1193.94059arXiv0905.3135MaRDI QIDQ3585200FDOQ3585200


Authors: Ayan Mahalanobis Edit this on Wikidata


Publication date: 19 August 2010

Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0905.3135




Recommendations




Cites Work


Cited In (12)





This page was built for publication: The discrete logarithm problem in the group of non-singular circulant matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585200)