Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring

@article{Biham1999BreakingGD,
  title={Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring},
  author={Eli Biham and Dan Boneh and Omer Reingold},
  journal={Inf. Process. Lett.},
  year={1999},
  volume={70},
  pages={83-87}
}
The Diffie-Hellman key-exchange protocol may naturally be extended to k > 2 parties. This gives rise to the generalized Diffie-Hellman assumption (GDH-Assumption). Naor and Reingold have recently shown an efficient construction of pseudo-random functions and proved its security based on the GDH-Assumption. In this note, we prove that breaking this assumption modulo a so called Blum-integer would imply an efficient algorithm for factorization. Therefore, both the key-exchange protocol and the… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS
32 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Shoup , Lower bounds for discrete logarithms and related problems

  • G. Tsudik M. Steiner
  • Diffie - Hellman key distribution extended to…
  • 1997

Composite Diffie-Hellman public-key generating systems are hard to break

  • Z. Shmuely
  • Technical Report No. 356,
  • 1985
3 Excerpts

Digitalized signatures and public-key functions as intractable as factorization, Technical Report, TR-212

  • M. O. Rabin
  • MIT Laboratory for Computer Science,
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…