A Candidate Counterexample to the Easy Cylinders Conjecture

DOI10.1007/978-3-642-22670-0_16zbMath1343.68083OpenAlexW1588024081MaRDI QIDQ3088184

Oded Goldreich

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_16

zbMATH Keywords

one-way functionsP/polytrapdoor permutations

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Candidate One-Way Functions Based on Expander Graphs
• Foundations of Cryptography
• Cryptography in $NC^0$

This page was built for publication: A Candidate Counterexample to the Easy Cylinders Conjecture