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 3 items.
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901) (← 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)
