Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits
- 1 January 2022
- book chapter
- Published by Springer Nature
- p. 614-644
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-32017
- Breaking Symmetric Cryptosystems Using Quantum Period Finding2016
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers2016
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates2016
- A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2013
- A Small Depth-16 Circuit for the AES S-Box2012
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SATLecture Notes in Computer Science, 2010
- Synthesis of reversible logic circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999
- A fast quantum mechanical algorithm for database search1996