Further insights on constructing quantum circuits for Camellia block cipher
From MaRDI portal
Publication:6182436
DOI10.1007/s11128-023-04182-zMaRDI QIDQ6182436
Yunyu Guo, Bing Sun, Jian Zou, Zejun Xiang, Da Lin
Publication date: 25 January 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A framework to optimize implementations of matrices
- Quantum reversible circuit of AES-128
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Some efficient quantum circuit implementations of Camellia
- New quantum circuit implementations of SM4 and SM3
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum circuit implementations of AES with fewer qubits
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Communication Theory of Secrecy Systems*
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Keccak
- Optimized quantum implementation of AES
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- Quantum circuit implementations of SM4 block cipher based on different gate sets
- Evolutionary-based searching method for quantum circuit architecture
This page was built for publication: Further insights on constructing quantum circuits for Camellia block cipher
