Advancements in Quantum Cryptography Threaten Symmetric Algorithms
Severity: Medium (Score: 51.9)
Sources: eprint.iacr.org
Summary
Recent research highlights the vulnerabilities of symmetric cryptography, particularly AES, to quantum computing threats such as Grover's algorithm. Liao and Luo (2025) propose new in-place synthesis methods that optimize the depth-times-width cost (DW-cost) of AES quantum circuits, achieving significant reductions in resource requirements. Their work demonstrates a DW-cost of 65,280 for AES-128, 87,552 for AES-192, and 112,896 for AES-256, marking a 46% reduction compared to previous solutions. Jaques et al. (2019) previously analyzed quantum attacks on AES, focusing on minimizing qubit usage while introducing techniques to reduce oracle depth. This ongoing research indicates a growing need for the cryptographic community to adapt to the realities of quantum computing. The implications of these findings extend to the security assessments of post-quantum cryptography, emphasizing the urgency for updated defenses against quantum attacks. Current implementations and resource estimates for AES and LowMC are now available, providing critical insights for future cryptographic standards. Key Points: • Quantum computing poses significant threats to symmetric cryptography, especially AES. • Liao and Luo's research achieves a 46% reduction in DW-cost for AES implementations. • New techniques for optimizing quantum circuits are essential for post-quantum cryptography.