On the Computational Hardness Needed for Quantum Cryptography
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.
Abstract 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. We consider EFI pairs — efficiently samplable, statistically far and computationally indistinguishable pairs of quantum states. Building on the work of…
saved by
related reading
- Unclonable Polymers and Their Cryptographic Applicationseprint.iacr.org
- Unclonable Polymers and Their Cryptographic Applicationseprint.iacr.org
- Quantum computing for the very curiousquantum.country
- How Quantum Computers affect Cryptography and Blockchain, and Solutionsblog.aayushg.com
- [2601.20927] Entangling logical qubits without physical operationsarxiv.org
- [2603.28846] Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigationsarxiv.org
- How the quantum search algorithm worksquantum.country
- ZX-based quantum obfuscation for dummies – 20[ ] – The blogblog.20squares.xyz
- How Quantum Computing Can Tackle Climate and Energy Challenges - Eoseos.org
- Quantum computing - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Quantum computing bombshells that are not April Foolsscottaaronson.blog
- 370.pdfeprint.iacr.org