Concrete quantum cryptanalysis of binary elliptic curves via addition chain
DOI10.1007/978-3-031-30872-7_3OpenAlexW4366310652MaRDI QIDQ6080896
Publication date: 4 October 2023
Published in: Topics in Cryptology – CT-RSA 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30872-7_3
Cryptography (94A60) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Elliptic curves (14H52) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Lacunary inversion theorems (40E15) Quantum cryptography (quantum-theoretic aspects) (81P94) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65) Logarithmic algebraic geometry, log schemes (14A21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms
- Realization of a scalable Shor algorithm
- Shor’s Quantum Factoring Algorithm on a Photonic Chip
- Elliptic Curve Cryptosystems
- A method for obtaining digital signatures and public-key cryptosystems
- Simulating quantum systems on a quantum computer
- Improved Quantum Circuits for Elliptic Curve Discrete Logarithms
- Fast Inversion in <formula formulatype="inline"><tex Notation="TeX">${\schmi{GF(2^m)}}$</tex></formula> with Normal Basis Using Hybrid-Double Multipliers
This page was built for publication: Concrete quantum cryptanalysis of binary elliptic curves via addition chain
