Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1749| Title: | Are Matrices Useful in Public-Key Cryptography? |
| Authors: | MAHALANOBIS, AYAN Dept. of Mathematics |
| Keywords: | The discrete logarithm problem Circulant matrices Elliptic curve cryptosystems 2013 |
| Issue Date: | Jan-2013 |
| Publisher: | Hikari |
| Citation: | International Mathematical Forum, 8(39), 1939 - 1953. |
| 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. |
| URI: | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1749 http://dx.doi.org/10.12988/imf.2013.310187 |
| ISSN: | 1312-7594 1314-7536 |
| Appears in Collections: | JOURNAL ARTICLES |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.