Are Matrices Useful in Public-Key Cryptography?

dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.date.accessioned	2019-02-14T05:46:12Z
dc.date.available	2019-02-14T05:46:12Z
dc.date.issued	2013-01	en_US
dc.identifier.citation	International Mathematical Forum, 8(39), 1939 - 1953.	en_US
dc.identifier.issn	1312-7594	en_US
dc.identifier.issn	1314-7536	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1749
dc.identifier.uri	http://dx.doi.org/10.12988/imf.2013.310187	en_US
dc.description.abstract	The discrete logarithm problem is the most prolific cryptographic primitive in use. Though the most important ones are the DiffieHellman problem and the decision Diffie-Hellman problem. In this paper, we discuss the discrete logarithm problem in circulant matrices – providing many particular secure instances. We compare the discrete logarithm problem in circulant matrices with that of the discrete logarithm problem in finite fields and with the discrete logarithm problem in the group of rational points of an elliptic curve.	en_US
dc.language.iso	en	en_US
dc.publisher	Hikari	en_US
dc.subject	The discrete logarithm problem	en_US
dc.subject	Circulant matrices	en_US
dc.subject	Elliptic curve cryptosystems	en_US
dc.subject	2013	en_US
dc.title	Are Matrices Useful in Public-Key Cryptography?	en_US
dc.type	Article	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.sourcetitle	International Mathematical Forum	en_US
dc.publication.originofpublisher	Foreign	en_US