Skip to main content

One-Way Function

  • Reference work entry
  • 532 Accesses

Related Concepts

Public Key Cryptography; Trapdoor One-Way Function

Definition

Informally, a one-way function is a function for which computation in one direction is straightforward, while computation in the reverse direction is far more difficult.

Background

The seminal paper of Diffie and Hellman [1] was the first to set down the potential of one-way functions in the development of public-key cryptography. The interesting, and important, feature of the one-way function is the asymmetry in computational effort required to perform a function evaluation and its reverse.

Theory

While the informal definition gives the flavour of the one-way function, it is typically described in a more formal, though still not rigorous, way [34] as a function f with domain X and range (codomain) Y, where f(x) is “easy” to compute for all \(x \in X\); but for “virtually all” elements \(y \in Y\), it is “computationally infeasible” to find an x such that \(f(x) = y\). The function fis a one-way...

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4419-5906-5_467
  • Chapter length: 2 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   849.99
Price excludes VAT (USA)
  • ISBN: 978-1-4419-5906-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Hardcover Book
USD   999.99
Price excludes VAT (USA)

Recommended Reading

  1. Diffie W, Hellman ME (1976) New directions in cryptography. IEEE T Info Theory IT-22(6):644–654

    Google Scholar 

  2. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. Freeman, San Francisco

    MATH  Google Scholar 

  3. Goldreich O (1999) Modern cryptography, probabilistic proofs and pseudorandomness. Springer, Berlin

    Google Scholar 

  4. Menezes AJ, van Oorschot PC, Vanstone SA (1997) Handbook of applied cryptography. CRC, Boca Raton

    MATH  Google Scholar 

  5. Needham RM, Schroeder MD (1978) Using encryption for authentication in large networks of computers. Commun ACM 21:993–999

    CrossRef  MATH  Google Scholar 

  6. Yao AC (1982) Theory and applications of trapdoor functions. In: Proceedings of the IEEE 23rd annual symposium on foundations of computer science, Chicago, pp 80–91

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Robshaw, M.J.B. (2011). One-Way Function. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_467

Download citation