activity
20162023
most citedA Probabilistic Baby-Step Giant-Step Algorithm

2 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.CR2016★ 2 cited

Improved Lower Bound on DHP: Towards the Equivalence of DHP and DLP for Important Elliptic Curves Used for Implementation

Prabhat Kushwaha

In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to Diffie-Hellman problem in order to estimate lower bound on Diffie-Hellman prob…