A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More

ePrint Report: A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More

Minki Hhan

This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models.
- In the classical generic group model (GGM), we find simple alternative proofs for the lower bounds of variants of the discrete logarithm (DL) problem: the multiple-instance DL and one-more DL problems (and their mixture). We also re-prove the unknown-order GGM lower …

cryptographic eprint report factoring limitations mdl problems quantum report settings studies