scientific article; zbMATH DE number 7759460

DOI10.4230/LIPICS.ITC.2020.8MaRDI QIDQ6059367zbMATH OpenFDO

Authors Kai-Min Chung, Tai-Ning Liao, Luowen Qian

Publication date 2 November 2023

Full work available at URL https://arxiv.org/abs/1911.09176

zbMATH Keywords

cryptanalysisdata structuresquantum query complexity

Mathematics Subject Classification ID

Data structures (68P05) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cited in

(10)

• Quantum algorithm to solve function inversion with time-space trade-off
• A full characterization of quantum advice
• Non-uniformity and quantum advice in the quantum random oracle model
• Revisiting time-space tradeoffs for function inversion
• Quantum time/memory/data tradeoff attacks
• The NISQ complexity of collision finding
• Unconditionally secure commitments with quantum auxiliary inputs
• On the power of adaptivity for function inversion
• A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
• On the efficiency of generic, quantum cryptographic constructions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6059367)