Are matrices useful in public-key cryptography?
Ayan Mahalanobis · International Mathematical Forum · 2013
Copyright c © 2013 Ayan Mahalanobis. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract. The discrete logarithm problem is the most prolific crypto-graphic primitive in use. Though the most important ones are the Diffie-Hellman 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.