Journal Article
Quantum Analysis of AES
Kyungbae Jang,Anubhab Baksi,Gyeongju Song,Hyun-Jun Kim,Hwajeong Seo,Anupam Chattopadhyay +5 more
- Vol. 2022, pp 683-683
TLDR
This work presents the least Toffoli depth and full depth implementations of AES, thereby improving from Zou et al.Abstract:
. Quantum computing is considered among the next big leaps in the computer science. While a fully functional quantum computer is still in the future, there is an ever-growing need to evaluate the security of the secret-key ciphers against a potent quantum adversary. Keeping this in mind, our work explores the key recovery attack using the Grover’s search on the three variants of AES (-128, -192, -256) with respect to the quantum implementation and the quantum key search using the Grover’s algorithm. We develop a pool of implementations, by mostly reducing the circuit depth metrics. We consider various strategies for optimization, as well as make use of the state-of-the-art advancements in the relevant fields. In a nutshell, we present the least Toffoli depth and full depth implementations of AES, thereby improving from Zou et al.’s Asiacrypt’20 paper by more than 98 percent for all variants of AES. Our qubit count - Toffoli depth product is improved from theirs by more than 75 percent. Furthermore, we analyze the Jaques et al.’s Eurocrypt’20 implementations in details, fix its bugs and report corrected benchmarks. To the best of our finding, our work improves from all the previous works (including the recent Eprint’22 paper by Huang and Sun) in terms of Toffoli/full depth and Toffoli depth - qubit count product.read more
Citations
More filters
Journal Article
Quantum Implementation and Analysis of DEFAULT
TL;DR: This paper presents the quantum implementation and analysis of the recently proposed block cipher, DEFAULT, and discusses about the the various choices made to keep the cost for the basic quantum circuit and that of the Grover’s oracle search.
Journal ArticleDOI
Parallel quantum addition for Korean block ciphers
Journal ArticleDOI
SPEEDY Quantum Circuit for Grover’s Algorithm
Gyeongju Song,Kyoungbae Jang,Hyunjun Kim,Siwoo Eum,Min Gyu Sim,Hyun-Jun Kim,Wai-Kong Lee,Hwajeong Seo +7 more
TL;DR: This paper proposes a quantum circuit for the SPEEDY block cipher for the first time and estimates its security strength based on the post-quantum security strength presented by NIST and shows that SPEEDy provides either 128-bit security or 192-bitSecurity depending on the number of rounds.
Journal Article
DORCIS: Depth Optimized Quantum Implementation of Substitution Boxes
TL;DR: DORCIS as mentioned in this paper is a tool that finds depth-optimized quantum circuit implementations for arbitrary 3-and 4-bit S-boxes by taking quantum decomposition (i.e., Clifford + T gates) into account.
References
More filters
Book
The Design of Rijndael: AES - The Advanced Encryption Standard
Joan Daemen,Vincent Rijmen +1 more
TL;DR: The underlying mathematics and the wide trail strategy as the basic design idea are explained in detail and the basics of differential and linear cryptanalysis are reworked.
Book
Quantum Computation and Quantum Information: 10th Anniversary Edition
TL;DR: Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.
Posted Content
A fast quantum mechanical algorithm for database search
TL;DR: In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Journal ArticleDOI
Tight bounds on quantum searching
TL;DR: A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.
Journal ArticleDOI
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
TL;DR: An algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speedup over simple brute force algorithms is presented.