Pages that link to "Item:Q2798791"
From MaRDI portal
The following pages link to Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields (Q2798791):
Displayed 11 items.
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- On the discrete logarithm problem for prime-field elliptic curves (Q1747918) (← links)
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? (Q2023309) (← links)
- Complexity bounds on Semaev's naive index calculus method for ECDLP (Q2025337) (← links)
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem (Q2191201) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
- On the security properties of Russian standardized elliptic curves (Q3382027) (← links)
- Construction of strong elliptic curves suitable for cryptographic applications (Q3383074) (← links)
- (Q5068487) (← links)
- A Generalised Successive Resultants Algorithm (Q5267797) (← links)
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation (Q6162380) (← links)