Efficient algorithm to solve DLP from partial knowledge of the Key

dc.contributor.author	Kumar, N. Anil
dc.contributor.author	Bhagvati, Chakravarthy
dc.date.accessioned	2022-03-27T05:54:43Z
dc.date.available	2022-03-27T05:54:43Z
dc.date.issued	2013-03-12
dc.description.abstract	The discrete logarithm problem (DLP) is assumed to be hard from computational point of view. Side channel attacks are used to reveal information about the key if proper countermeasures are not used. We study the discrete logarithm problem assuming that partial information about the key is known. K. Gopalakrishnan et al. provided algorithms to solve the discrete logarithm problem for generic groups which are considerably better than square-root attack on the whole key when one contiguous bits of the key is revealed. This paper provides algorithms which will work when more than one contiguous bits of the key are revealed with time complexity of (unknownbits) order square root 2. © 2013 IEEE.
dc.identifier.citation	2013 International Conference on Computer Communication and Informatics, ICCCI 2013
dc.identifier.uri	10.1109/ICCCI.2013.6466138
dc.identifier.uri	http://ieeexplore.ieee.org/document/6466138/
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/8736
dc.subject	Discrete Logartihm Problem
dc.subject	Elliptic curves
dc.subject	partial knowledge of key
dc.subject	Pollard's kangaroo Algorithm
dc.title	Efficient algorithm to solve DLP from partial knowledge of the Key
dc.type	Conference Proceeding. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1