Optimized quantum implementation of elliptic curve arithmetic over binary fields
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5320241
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- An \(O(m^2)\)-depth quantum algorithm for the elliptic curve discrete logarithm problem over \(\mathrm{GF}(2^m)^\alpha\)
- Improved quantum circuits for elliptic curve discrete logarithms
- Quantum resource estimates for computing elliptic curve discrete logarithms
Cited in
(10)- T-count optimized Wallace tree integer multiplier for quantum computing
- An \(O(m^2)\)-depth quantum algorithm for the elliptic curve discrete logarithm problem over \(\mathrm{GF}(2^m)^\alpha\)
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- Quantum resource estimates for computing elliptic curve discrete logarithms
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- Reduction of the semigroup-action problem on a module to the hidden-subgroup problem
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
- Improved quantum circuits for elliptic curve discrete logarithms
This page was built for publication: Optimized quantum implementation of elliptic curve arithmetic over binary fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522548)
