Towards the Equivalence of Breaking the Diie-hellman Protocol and Computing Discrete Logarithms ?


Let G be an arbitrary cyclic group with generator g and order jGj with known factorization. G could be the subgroup generated by g within a larger group H. Based on an assumption about the existence of smooth numbers in short intervals, we prove that breaking the Diie-Hellman protocol for G and base g is equivalent to computing discrete logarithms in G to… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics