Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
From MaRDI portal
Publication:2516141
DOI10.1007/s11128-015-0993-1zbMath1327.81132OpenAlexW853818564MaRDI QIDQ2516141
Shane Kepley, Rainer Steinwandt
Publication date: 11 August 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-015-0993-1
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (3)
Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication ⋮ Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
Uses Software
Cites Work
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
- Quantum algorithms for algebraic problems
- Polynomial factorization over ${\mathbb F}_2$
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
