The following pages link to (Q3181587):
Displayed 4 items.
- 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)
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (Q2516141) (← links)
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis (Q2677252) (← links)