Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter June 23, 2010

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

  • Ayan Mahalanobis

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.

Received: 2009-09-21
Published Online: 2010-06-23
Published in Print: 2010-June

© de Gruyter 2010

Downloaded on 19.3.2024 from https://www.degruyter.com/document/doi/10.1515/gcc.2010.006/html
Scroll to top button