Skip to main content
SpringerLink
Log in

The square root Diffie–Hellman problem

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Many cryptographic schemes are based on computationally hard problems. The computational Diffie–Hellman problem is the most well-known hard problem and there are many variants of it. Two of them are the square Diffie–Hellman problem and the square root Diffie–Hellman problem. There have been no known reductions from one problem to the other in either direction. In this paper we show that these two problems are polynomial time equivalent under a certain condition. However, this condition is weak, and almost all of the parameters of cryptographic schemes satisfy this condition. Therefore, our reductions are valid for almost all cryptographic schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bao F., Deng R.H., Zhu H.: Variations of Diffie–Hellman Problem. In: ICICS, LNCS, vol. 2836, pp. 301–312 (2003).

  2. Diffie W., Hellman M.E.: New directions in cryptography. IEEE Trans. Inform. Theory 22(6), 644–654 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  3. Konoma C., Mambo M., Shizuya H.: The computational difficulty of solving cryptographic primitive problems related to the discrete logarithm problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E88-A-1, 81–88 (2005)

    Article  Google Scholar 

  4. Maurer U., Wolf S.: Diffie–Hellman oracles. CRYPTO, LNCS 1109, 268–282 (1996)

    MathSciNet  Google Scholar 

  5. Menezes A., van Oorschot P., Vanstone S.: Handbook of Applied Cryptogrphay. CRC Press, Boca Raton (1996)

    Book  Google Scholar 

  6. Mitsunari S., Sakai R., Kasahara M.: A new traitor tracing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E85-A-2, 481–484 (2002)

    Google Scholar 

  7. NIST: Recommended elliptic curves for federal government use. http://csrc.nist.gov/groups/ST/toolkit/documents/dss/NISTReCur.pdf (1999).

  8. Shanks D.: Five number-theoretic algorithms. In: Proceedings of the Second Manitoba Conference on Numerical Mathematics, pp. 51–70 (1973).

Download references

Author information

Authors and Affiliations

  1. National Institute for Mathematical Sciences, Daejeon, Republic of Korea

    Dongyoung Roh

  2. Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea

    Sang Geun Hahn

Authors
  1. Dongyoung Roh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sang Geun Hahn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dongyoung Roh.

Additional information

Communicated by S. D. Galbraith.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roh, D., Hahn, S.G. The square root Diffie–Hellman problem. Des. Codes Cryptogr. 62, 179–187 (2012). https://doi.org/10.1007/s10623-011-9503-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-011-9503-3

Keywords

Mathematics Subject Classification (2000)

Search

Navigation