Pages that link to "Item:Q908041"

The following pages link to Recent progress on the elliptic curve discrete logarithm problem (Q908041):

Displaying 19 items.

• On index calculus algorithms for subfield curves (Q832332) (← links)
• Cryptocash, cryptocurrencies, and cryptocontracts (Q908043) (← links)
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
• The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
• On the discrete logarithm problem for prime-field elliptic curves (Q1747918) (← links)
• New results on quasi-subfield polynomials (Q1979951) (← links)
• Extending the GLS endomorphism to speed up GHS Weil descent using Magma (Q1979955) (← links)
• On the first fall degree of summation polynomials (Q2009417) (← 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)
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
• Source-location privacy full protection in wireless sensor networks (Q2195316) (← links)
• Koblitz curves over quadratic fields (Q2318090) (← links)
• A probabilistic analysis on a lattice attack against DSA (Q2329391) (← links)
• Still wrong use of pairings in cryptography (Q2335138) (← links)
• Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves (Q5055960) (← links)
• An authenticated key scheme over elliptic curves for topological networks (Q5059582) (← links)
• Short Generators Without Quantum Computers: The Case of Multiquadratics (Q5738870) (← links)