Concrete quantum cryptanalysis of binary elliptic curves via addition chain
From MaRDI portal
Publication:6492517
DOI10.1007/S11128-024-04323-YMaRDI QIDQ6492517
Publication date: 25 April 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
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
- 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
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
This page was built for publication: Concrete quantum cryptanalysis of binary elliptic curves via addition chain
