On Constructing 1-1 One-Way Functions
From MaRDI portal
Publication:3088171
DOI10.1007/978-3-642-22670-0_3zbMath1343.94056OpenAlexW2395825961MaRDI QIDQ3088171
Oded Goldreich, Noam Nisan, Leonid A. Levin
Publication date: 19 August 2011
Published in: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22670-0_3
Related Items
Collapsing and separating completeness notions under average-case and worst-case hypotheses ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ On a family of preimage-resistant functions ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
Cites Work
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- PRIMES is in P
- Randomness is linear in space
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- A Pseudorandom Generator from any One-way Function
- On the Existence of Pseudorandom Generators
- Foundations of Cryptography
- Foundations of Cryptography
- Theory of Cryptography
