A Variational Quantum Attack for AES-like Symmetric Cryptography

Abstract

We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography, as exemplified the simplified-data encryption standard (S-DES). In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph, and the ground state can be found using a variational approach. We designed the ansatz and cost function for the S-DES's variational quantum attack. It is surprising that sometimes the VQAA is even faster than Grove's algorithm as demonstrated by our simulation results. The relationships of the entanglement entropy, concurrence and the cost function are investigated, which indicate that entanglement plays a crucial role in the speedup.

References in corpus (2)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Simulated Quantum Computation of Molecular Energies

Cited by in corpus (5)

• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Quantum All-Subkeys-Recovery Attacks on 6-round Feistel-2* Structure Based on Multi-Equations Quantum Claw Finding
• Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks
• Post-Quantum Security: Origin, Fundamentals, and Adoption