Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
The discrete logarithm problem in the group of non-singular circulant matrices
-
Ayan Mahalanobis
Veröffentlicht/Copyright:
23. Juni 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
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- 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
Artikel in diesem Heft
- 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
