Article
Licensed
Unlicensed
Requires Authentication
The discrete logarithm problem in the group of non-singular circulant matrices
-
Ayan Mahalanobis
Published/Copyright:
June 23, 2010
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.
Keywords.: The discrete logarithm problem; circulant matrices
Received: 2009-09-21
Published Online: 2010-06-23
Published in Print: 2010-June
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On Shephard groups with large triangles
- An update on Hurwitz groups
- Presentations of matrix rings
- The diameter of a random Cayley graph of ℤq
- Challenge response password security using combinatorial group theory
- The discrete logarithm problem in the group of non-singular circulant matrices
- Algebraic geometry over natural numbers. The classification of coordinate monoids
Articles in the same Issue
- On Shephard groups with large triangles
- An update on Hurwitz groups
- Presentations of matrix rings
- The diameter of a random Cayley graph of ℤq
- Challenge response password security using combinatorial group theory
- The discrete logarithm problem in the group of non-singular circulant matrices
- Algebraic geometry over natural numbers. The classification of coordinate monoids
