About: One-way function

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: One-way function Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Disease, within Data Space : el.dbpedia.org associated with source document(s)

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. Not being one-to-one is not considered sufficient for a function to be called one-way (see , below).

Attributes	Values
rdf:type	disease
rdfs:label	One-way function (en)
rdfs:comment	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. Not being one-to-one is not considered sufficient for a function to be called one-way (see , below). (en)
sameAs	One-way function One-way function
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_book dbt:Mvar dbt:Reflist dbt:Rp dbt:Short_description dbt:Isbn dbt:Unsolved
Subject	Cryptographic primitives Cryptography Unsolved problems in computer science
gold:hypernym	Function
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/One-way_function?oldid=1073146982&ns=0
Wikipage page ID	363890 (xsd:integer)
page length (characters) of wiki page	13728 (xsd:nonNegativeInteger)
Wikipage revision ID	1073146982 (xsd:integer)
has abstract	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. Not being one-to-one is not considered sufficient for a function to be called one-way (see , 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/One-way_function
is Wikipage redirect of	One-way functions One way function One-way encryption One-way permutation One-way security Collision-free hash function
is Link from a Wikipage to another Wikipage of	List of unsolved problems in computer science NT LAN Manager Non-commutative cryptography OWF Accumulator (cryptography) Alexander Razborov Average-case complexity Berman–Hartmanis conjecture Block cipher CEILIDH Cellular automaton Generic-case complexity Geometric cryptography Diffie–Hellman problem Digest access authentication Discrete logarithm Distributed point function Challenge-Handshake Authentication Protocol Cryptographic hash function Cryptography Humpty Dumpty (disambiguation) List decoding List of important publications in theoretical computer science Clifford Cocks Commitment scheme Statistical learning theory ElGamal encryption List of computability and complexity topics Michael Luby Elliptic curve point multiplication Function field sieve Fuzzy extractor Index of cryptography articles Indistinguishability obfuscation Hard-core predicate Hardware security Hash chain Interactive proof system Irreversible process Lamport signature Modular exponentiation MAC address anonymization Negligible function Collision-free hash function

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software