Pages that link to "Item:Q1703924"
From MaRDI portal
The following pages link to Quantum resource estimates for computing elliptic curve discrete logarithms (Q1703924):
Displaying 24 items.
- Curve448 on 32-bit ARM Cortex-M4 (Q831642) (← links)
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901) (← links)
- Computational problems in supersingular elliptic curve isogenies (Q1994699) (← links)
- A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE (Q2027276) (← links)
- Parallel quantum addition for Korean block ciphers (Q2102800) (← links)
- New quantum circuit implementations of SM4 and SM3 (Q2107956) (← links)
- Quantum security analysis of CSIDH (Q2119022) (← links)
- On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer (Q2146073) (← links)
- Towards quantum large-scale password guessing on real-world distributions (Q2149836) (← links)
- Delegating quantum computation in the quantum random oracle model (Q2175931) (← links)
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem (Q2677607) (← links)
- Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments (Q4964354) (← links)
- Boolean satisfiability in quantum compilation (Q4993497) (← links)
- Improved Quantum Circuits for Elliptic Curve Discrete Logarithms (Q5041233) (← links)
- New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm (Q6098309) (← links)
- Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields (Q6171431) (← links)
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain (Q6492517) (← links)
- Making an asymmetric PAKE quantum-annoying by hiding group elements (Q6550618) (← links)
- Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction (Q6584316) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- Quantum weakest preconditions for reasoning about expected runtimes of quantum programs (Q6649432) (← links)
- Quantum complexity for discrete logarithms and related problems (Q6652978) (← links)
- Space-efficient and noise-robust quantum factoring (Q6652983) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)