On the Computational Hardness of Quantum One-Wayness
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generators can be built from each other, and thus require equivalent computational assumptions to be realized. Furthermore, the...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-03-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2025-03-27-1679/pdf/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|