✳flâneur — a map of the web's best reading
On the Computational Hardness Needed for Quantum Cryptography
simons.berkeley.edu · 1 words · saved by 1 readers
In the classical model of computation, one-way functions (OWF) are arguably minimal for computational cryptography, namely they are essential for almost any cryptographic application that can only be realized with respect to computationally bounded adversaries. In the quantum setting, however, OWFs appear not to be essential (Kretschmer 2021; Ananth et al., Morimae and Yamakawa 2022); in particular, no minimal primitive is known.
Explore this link on the map →