Book ChapterDOI
Quantum Resource Estimates of Grover’s Key Search on ARIA
TLDR
Grover's algorithm provides a quantum attack against block ciphers by searching for a k-bit key using O(sqrt{2k} ) calls to the cipher, when given a small number of plaintext-ciphertext pairs as mentioned in this paper.Abstract:
Grover’s algorithm provides a quantum attack against block ciphers by searching for a k-bit key using \(O(\sqrt{2^k})\) calls to the cipher, when given a small number of plaintext-ciphertext pairs. Recent works by Grassl et al. in PQCrypto’16 and Almazrooie et al. in QIP’18 have estimated the cost of this attack against AES by analyzing the quantum circuits of the cipher.read more
Citations
More filters
Journal ArticleDOI
A Practical-Quantum Differential Attack on Block Ciphers
TL;DR: The proposed method is used to design the quantum circuit to search the differential characteristics for a toy cipher smallGIFT and to validate differential and impossible differential characteristics obtained using proposed method.
Journal ArticleDOI
Improved Low-depth SHA3 Quantum Circuit for Fault-tolerant Quantum Computers
TL;DR: In this article , the authors proposed a low-depth SHA3 quantum circuit implementation for fault-tolerant quantum computers to reduce errors, which achieved T-depth and full-depth reductions of 30.3% and 80.05%, respectively.
Journal ArticleDOI
Compact Quantum Circuit Design of PUFFIN and PRINT Lightweight Ciphers for Quantum Key Recovery Attack
TL;DR: In this paper , a quantum key recovery attack using Grover-based key search algorithm is proposed for two lightweight block ciphers, namely PUFFIN and PRINT, and the quantum resources are also estimated to mount the quantum recovery attacks on the proposed quantum circuit implementations.
Journal ArticleDOI
Look-up the Rainbow: Table-based Implementation of Rainbow Signature on 64-bit ARMv8 Processors
TL;DR: In this article , a look-up table-based tower-field multiplication technique was proposed to accelerate the Rainbow signature implementation on 64-bit ARMv8 processors, which achieved 428.73 × and 114.16 × better performance for finite field multiplications and Rainbow signatures respectively.
References
More filters
Proceedings ArticleDOI
A fast quantum mechanical algorithm for database search
TL;DR: In this paper, it was shown that a quantum mechanical computer can solve integer factorization problem in a finite power of O(log n) time, where n is the number of elements in a given integer.
Journal ArticleDOI
Tight bounds on quantum searching
TL;DR: In this article, a tight analysis of Grover's recent algorithm for quantum database searching is provided, where the probability of success after any given number of iterations of the algorithm is given.
Qiskit: An Open-source Framework for Quantum Computing
Gadi Aleksandrowicz,Thomas Alexander,Panagiotis Kl. Barkoutsos,Luciano Bello,Yael Ben-Haim,David Bucher,Francisco Jose Cabrera-Hernández,Jorge Carballo-Franquis,Adrian Chen,Chun-Fu Chen,Jerry M. Chow,Antonio D. Córcoles-Gonzales,Abigail J. Cross,Andrew W. Cross,Juan Cruz-Benito,Chris Culver,Salvador De La Puente González,Enrique De La Torre,Delton Ding,Eugene F. Dumitrescu,Ivan Duran,Pieter T. Eendebak,Mark Everitt,Ismael Faro Sertage,Albert Frisch,Andreas Fuhrer,Jay M. Gambetta,Borja Godoy Gago,Juan Gomez-Mosquera,Donny Greenberg,Ikko Hamamura,Vojtech Havlicek,Joe Hellmers,Łukasz Herok,Hiroshi Horii,Shaohan Hu,Takashi Imamichi,Toshinari Itoko,Ali Javadi-Abhari,Naoki Kanazawa,Anton Karazeev,Kevin Krsulich,Peng Liu,Yang Luh,Yunho Maeng,Manoel Marques,Francisco Martín-Fernández,Douglas McClure,David McKay,Srujan Meesala,Antonio Mezzacapo,Nikolaj Moll,Diego Moreda Rodríguez,Giacomo Nannicini,P. D. Nation,Pauline J. Ollitrault,Lee James O'Riordan,Hanhee Paik,Jesús Pérez,Anna Phan,Marco Pistoia,Viktor Prutyanov,Max Reuter,Julia E. Rice,Abdón Rodríguez Davila,Raymond Harry Rudy,Mingi Ryu,Ninad Sathaye,Chris Schnabel,Eddie Schoute,Kanav Setia,Yunong Shi,Adenilton Silva,Yukio Siraichi,Seyon Sivarajah,John A. Smolin,Mathias Soeken,Hitomi Takahashi,Ivano Tavernelli,Charles Taylor,Pete Taylour,Kenso Trabing,Matthew Treinish,Wes Turner,Desiree Vogt-Lee,Christophe Vuillot,Jonathan A. Wildstrom,Jessica Wilson,Erick Winston,Christopher J. Wood,Stephen P. Wood,Stefan Wörner,Ismail Yunus Akhalwaya,Christa Zoufal +93 more
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.
Journal ArticleDOI
Quantum circuits of T-depth one
TL;DR: A class of circuits whose T- depth can be reduced to 1 by using sufficiently many ancillas is described, and it is shown that the cost of adding an additional control to any controlled gate is at most 8 additional T-gates, and T-depth 2.