Live briefing
Everything about One-way function
Function used in computer cryptography
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: One-way functionA 5-minute orientation
- Skim a recent paper: Noncoherent Massive MIMO With Embedded One-Way Function Physical Layer SecurityInfluential work since 2022
- Pick up a classic book: Zusammenfassung über Bauwerke und den Einfachsten Dingen des Lebens, teilweise mit und in der SchriftThe most-reprinted book on the subject
- Read the landmark paper: A Pseudorandom Generator from any One-way FunctionCited 1,119 times
- Go sideways: Random self-reducibilityA closely related topic
- Go sideways: Average-case complexityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A Pseudorandom Generator from any One-way Function
Key establishment in large dynamic groups using one-way function trees
Multistage secret sharing based on one-way function
A fast software one-way hash function
Multisecret-sharing scheme based on one-way function
A dynamic password authentication method using a one‐way function
A new multi-stage secret sharing scheme using one-way function
One-way hash function construction based on chaotic map network
🆕 Influential since 2022
Noncoherent Massive MIMO With Embedded One-Way Function Physical Layer Security
Experimental Boson Sampling Enabling Cryptographic One-Way Function
A trapdoor one-way function for verifiable secret sharing
Dynamic full quantum one-way function based on quantum circuit mapping
Universal construction of a full quantum one-way function
📚 Books worth reading
Zusammenfassung über Bauwerke und den Einfachsten Dingen des Lebens, teilweise mit und in der SchriftSebastian Ebner · 2025
Zusammenfassung Bauwerke (Summary Buildings)Sebastian Ebner · 2024
Zusammenfassung Für „Statisch auf die Erde Bauen“ Version 0.1Sebastian Ebner · 2022
Zusammenfassung für den Schwerpunkt BauwerkeSebastian Ebner · 2023
Zusammenfassungen mit dem Hauptinteresse "Bauwerke" und dem Nebeninteresse "Die Einfachsten Dinge des Lebens, teilweise mit und in der Schrift" sowie weitere NebeninteressenSebastian Ebner · 2026
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Random self-reducibility Random self-reducibility (RSR) is the rule that a good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability to…
- Average-case complexity In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the…
- Discrete logarithm In mathematics, for given real numbers a and b, the logarithm logb(a) is a number x such that bx=a. The discrete logarithm is an analogous concept in group…
- Shor's algorithm Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor…
- Security of cryptographic hash functions In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based…
- Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…
- Very smooth hash In cryptography, Very Smooth Hash (VSH) is a provably secure cryptographic hash function invented in 2005 by Scott Contini, Arjen Lenstra, and Ron Steinfeld…
- Computational hardness assumption In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where…