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

dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.date.accessioned	2019-01-21T10:29:58Z
dc.date.available	2019-01-21T10:29:58Z
dc.date.issued	2010-06	en_US
dc.identifier.citation	Groups Complexity Cryptology, Vol.2(1).	en_US
dc.identifier.issn	1867-1144	en_US
dc.identifier.issn	1869-6104	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1513
dc.identifier.uri	https://doi.org/10.1515/gcc.2010.006	en_US
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	De Gruyter	en_US
dc.subject	Discrete logarithm problem	en_US
dc.subject	Circulant matrices	en_US
dc.subject	Cryptography	en_US
dc.subject	2010	en_US
dc.title	The discrete logarithm problem in the group of non-singular circulant matrices	en_US
dc.type	Article	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.sourcetitle	Groups Complexity Cryptology	en_US
dc.publication.originofpublisher	Foreign	en_US