Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/5598
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | KUSHWAHA, PRABHAT | en_US |
dc.coverage.spatial | Surat, India | en_US |
dc.date.accessioned | 2021-02-05T06:14:06Z | - |
dc.date.available | 2021-02-05T06:14:06Z | - |
dc.date.issued | 2017-07 | en_US |
dc.identifier.citation | 2017 ISEA Asia Security and Privacy (ISEASP). | en_US |
dc.identifier.isbn | 9781509059423 | en_US |
dc.identifier.isbn | 9781509059430 | en_US |
dc.identifier.issn | - | en_US |
dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/5598 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/abstract/document/7976981 | en_US |
dc.description.abstract | In this paper, we have improved the existing estimates of the minimum number of group operations required to solve Diffie-Hellman problem for important elliptic curves used in practice. This leads us towards the equivalence of Diffie-Hellman problem and the discrete logarithm problem for those important elliptic curves. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Diffie-Hellman problem | en_US |
dc.subject | Elliptic curves | en_US |
dc.subject | Discrete logarithm problem | en_US |
dc.subject | 2017 | en_US |
dc.title | Towards the equivalence of Diffie-Hellman problem and discrete logarithm problem for important elliptic curves used in practice | en_US |
dc.type | Conference Papers | en_US |
dc.contributor.department | Dept. of Mathematics | en_US |
dc.identifier.doi | https://doi.org/10.1109/ISEASP.2017.7976981 | en_US |
dc.identifier.sourcetitle | 2017 ISEA Asia Security and Privacy (ISEASP) | en_US |
dc.publication.originofpublisher | Foreign | en_US |
Appears in Collections: | CONFERENCE PAPERS |
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.