Characterizing the existence of one-way permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A survey of one-way functions in complexity theory
- Characterizing the existence of one-way permutations
- Complexity Measures for Public-Key Cryptosystems
- Compression and Ranking
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
- Easy sets and hard certificate schemes
- On the complexity of ranking
- Polynomial-time compression
- Relative complexity of checking and evaluating
Cited in
(7)- On characterizing the existence of partial one-way permutations
- On the circuit-size of inverses
- One-way permutations and self-witnessing languages
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions
- scientific article; zbMATH DE number 7311288 (Why is no real title available?)
- scientific article; zbMATH DE number 697804 (Why is no real title available?)
- Characterizing the existence of one-way permutations
This page was built for publication: Characterizing the existence of one-way permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575721)
