A Probabilistic Baby-step Giant-step Algorithm

Simple item page
dc.contributor.authorKushwaha, Prabhaten_US
dc.contributor.authorMAHALANOBIS, AYANen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.coverage.spatial-en_US
dc.date.accessioned2019-07-01T05:37:43Z
dc.date.available2019-07-01T05:37:43Z
dc.date.issued2017-07en_US
dc.description.abstractIn this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are considered to be the most conservative and safest curves among all NIST curves.en_US
dc.identifier.citationProceedings of the 14th International Joint Conference on e-Business and Telecommunications, 6: SECRYPT, 401-406.en_US
dc.identifier.doihttps://doi.org/10.5220/0006396304010406en_US
dc.identifier.isbn9789897582592en_US
dc.identifier.issn-en_US
dc.identifier.sourcetitleProceedings of the 14th International Joint Conference on e-Business and Telecommunicationsen_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3355
dc.identifier.urihttps://www.scitepress.org/Link.aspx?doi=10.5220/0006396304010406
dc.language.isoenen_US
dc.publication.originofpublisherForeignen_US
dc.publisherScience and Technology Publicationsen_US
dc.subjectDiscrete Logarithm Problemen_US
dc.subjectBaby-stepen_US
dc.subjectGiant-step Algorithmen_US
dc.subjectNIST Curvesen_US
dc.subjectOver Prime Fieldsen_US
dc.subjectParallelized Collision Searchen_US
dc.subject2017en_US
dc.titleA Probabilistic Baby-step Giant-step Algorithmen_US
dc.typeConference Papersen_US

Files

Collections

CONFERENCE PAPERS