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 FieldValueLanguage
dc.contributor.authorKUSHWAHA, PRABHATen_US
dc.coverage.spatialSurat, Indiaen_US
dc.date.accessioned2021-02-05T06:14:06Z-
dc.date.available2021-02-05T06:14:06Z-
dc.date.issued2017-07en_US
dc.identifier.citation2017 ISEA Asia Security and Privacy (ISEASP).en_US
dc.identifier.isbn9781509059423en_US
dc.identifier.isbn9781509059430en_US
dc.identifier.issn-en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/5598-
dc.identifier.urihttps://ieeexplore.ieee.org/abstract/document/7976981en_US
dc.description.abstractIn 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.isoenen_US
dc.publisherIEEEen_US
dc.subjectDiffie-Hellman problemen_US
dc.subjectElliptic curvesen_US
dc.subjectDiscrete logarithm problemen_US
dc.subject2017en_US
dc.titleTowards the equivalence of Diffie-Hellman problem and discrete logarithm problem for important elliptic curves used in practiceen_US
dc.typeConference Papersen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.identifier.doihttps://doi.org/10.1109/ISEASP.2017.7976981en_US
dc.identifier.sourcetitle2017 ISEA Asia Security and Privacy (ISEASP)en_US
dc.publication.originofpublisherForeignen_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.