On characterizing the existence of partial one-way permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3984573 (Why is no real title available?)
- scientific article; zbMATH DE number 1555957 (Why is no real title available?)
- A survey of one-way functions in complexity theory
- Characterizing the existence of one-way permutations
- Complexity Measures for Public-Key Cryptosystems
- Complexity classes without machines: on complete languages for UP
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
- Easy sets and hard certificate schemes
- On hardness of one-way functions
- On polynomial time one-truth-table reducibility to a sparse set
- P-Printable Sets
- Quasi-injective reductions
- Relative complexity of checking and evaluating
- Sperner's lemma and robust machines
Cited in
(4)
This page was built for publication: On characterizing the existence of partial one-way permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603545)