Pages that link to "Item:Q2516141"
From MaRDI portal
The following pages link to Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (Q2516141):
Displaying 10 items.
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901) (← links)
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves (Q2018146) (← links)
- Efficient quantum circuit of Proth number modular multiplication (Q2104467) (← links)
- T-count optimized Wallace tree integer multiplier for quantum computing (Q2239664) (← links)
- Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication (Q2684220) (← links)
- Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations (Q2686210) (← links)
- (Q3522431) (← links)
- Quantum circuits for high-degree and half-multiplication for post-quantum analysis (Q6547862) (← links)
- Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication (Q6629269) (← links)
