Lower Bounds for Preprocessing Attacks on Quantum Cryptography
This research establishes near-optimal time-space lower bounds for breaking quantum cryptography primitives like One-Way States and PRGs within the Random Oracle Model. By using matrix norms and trace moments, it proves that quantum systems offer a significant security advantage over classical ones, setting tight limits on how fast an attacker can break these cryptographic functions.