Quantum-Resistant One-Way Puzzles from Program Obfuscation and Kolmogorov Complexity: A Minimal-Assumption Framework
We introduce a novel construction of quantum-resistant one-way puzzles based on the uncomputability of Kolmogorov complexity and the obfuscation of pseudorandom generators. The security of our scheme relies on the minimal assumption that quantum polyn
Authors
- Maher Asaad Baker (ORCID: https://orcid.org/0000-0001-8013-6044)
- Fuad Al-Qrize (ORCID: https://orcid.org/0000-0003-3380-2176)
Institutions
- Institute of Solid State Chemistry (RU)
Publication Details
- Published
- 2025-08-26
- DOI
- https://doi.org/10.22541/au.175624416.69459338/v1
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00