Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

The discrete logarithm problem in the group of non-singular circulant matrices 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

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

Mahalanobis, Ayan
Groups - Complexity - Cryptology , Volume 2 (1) – Jun 1, 2010
Download PDF
7 pages

Loading next page...
 
/lp/de-gruyter/the-discrete-logarithm-problem-in-the-group-of-non-singular-circulant-2cjXOQbGNk
Publisher
de Gruyter
Copyright
© de Gruyter 2010
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/GCC.2010.006
Publisher site
See Article on Publisher Site

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.

Journal

Groups - Complexity - Cryptology – de Gruyter

Published: Jun 1, 2010

Keywords: The discrete logarithm problem; circulant matrices

There are no references for this article.