Concrete quantum cryptanalysis of binary elliptic curves via addition chain
From MaRDI portal
Logarithmic algebraic geometry, log schemes (14A21) Elliptic curves (14H52) Lacunary inversion theorems (40E15) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65) Quantum cryptography (quantum-theoretic aspects) (81P94) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Cryptography (94A60)
Recommendations
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Improved quantum circuits for elliptic curve discrete logarithms
- Optimized quantum implementation of elliptic curve arithmetic over binary fields
- Quantum resource estimates for computing elliptic curve discrete logarithms
- An \(O(m^2)\)-depth quantum algorithm for the elliptic curve discrete logarithm problem over \(\mathrm{GF}(2^m)^\alpha\)
Cites work
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- A method for obtaining digital signatures and public-key cryptosystems
- A quantum circuit for Shor's factoring algorithm using 2n+2 qubits
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Elliptic Curve Cryptosystems
- Fast Inversion in <formula formulatype="inline"><tex Notation="TeX">${\schmi{GF(2^m)}}$</tex></formula> with Normal Basis Using Hybrid-Double Multipliers
- scientific article; zbMATH DE number 5320229 (Why is no real title available?)
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- Improved quantum circuits for elliptic curve discrete logarithms
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Realization of a scalable shor algorithm
- Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms
- Shor’s Quantum Factoring Algorithm on a Photonic Chip
- Simulating quantum systems on a quantum computer
This page was built for publication: Concrete quantum cryptanalysis of binary elliptic curves via addition chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080896)