Pages that link to "Item:Q5503300"
From MaRDI portal
The following pages link to On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography (Q5503300):
Displaying 10 items.
- Quantum reversible circuit of AES-128 (Q1654144) (← links)
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves (Q2018146) (← links)
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (Q2516141) (← 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)
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178) (← links)
- Optimized quantum implementation of SEED (Q6547849) (← links)
- Depth-optimized quantum implementation of ARIA (Q6547850) (← links)
- Reduction of the semigroup-action problem on a module to the hidden-subgroup problem (Q6617025) (← links)
- And-gates in ZX-calculus: spider nest identities and QBC-completeness (Q6645586) (← links)
