Metraipolis › archive › dc_72d368809f5f
One-way function — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/One-way_function
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:38:11.082Z
- SHA-256 of the archived text
7199f2332248c66a3807e6ef328fd9e15286c62e0a674234d7d5c18fb00eb8a8- Stable URL of this page
https://metraipolis.com/documento/dc_72d368809f5f
How to cite
One-way function — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/One-way_function (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_72d368809f5f (Metraipolis archive dc_72d368809f5f, sha256 7199f2332248c66a3807e6ef328fd9e15286c62e0a674234d7d5c18fb00eb8a8)
BibTeX
@misc{dc72d368809f5f,
title = {One-way function — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/One-way_function},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_72d368809f5f; sha256 7199f2332248c66a3807e6ef328fd9e15286c62e0a674234d7d5c18fb00eb8a8},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/One-way_function. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. This has nothing to do with whether the function is one-to-one; finding any one input with the desired image is considered a successful inversion. (See § Theoretical definition, below.) The existence of such one-way functions is still an open conjecture. Their existence would prove that the complexity classes P and NP are not equal, thus resolving the foremost unsolved question of theoretical computer science. The converse is not known to be true, i.e. the existence of a proof that P ≠ NP would not directly imply the existence of one-way functions. In applied contexts, the terms "easy" and "hard" are usually interpreted relative to some specific computing entity; typically "cheap enough for the legitimate users" and "prohibitively expensive for any malicious agents". One-way functions, in this sense, are fundamental tools for cryptography, personal identification, authentication, and other data security applications. While the existence of one-way functions in this sense is also an open conjecture, there are several candidates that have withstood decades of intense scrutiny. Some of them are essential ingredients of most telecommunications, e-commerce, and e-banking systems around the world. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «cryptographic hash function»). Fonte: Wikipedia in inglese, voce «One-way function» — https://en.wikipedia.org/wiki/One-way_function Wikidata Q720931 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q720931 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/One-way_function?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1368790985, consultata il 2026-10-05T23:49:59.948Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 710d02a00fb9b051491240fe73913985bb072dfa503ef0496f7154e1964c8206