Pages that link to "Item:Q733510"

The following pages link to Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510):

Displaying 43 items.

• Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
• Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
• An optimal representation for the trace zero subgroup (Q521853) (← links)
• Improvement of FPPR method to solve ECDLP (Q740119) (← links)
• On index calculus algorithms for subfield curves (Q832332) (← links)
• Index calculus in the trace zero variety (Q895005) (← links)
• Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
• Index calculus in class groups of non-hyperelliptic curves of genus three (Q1021239) (← links)
• Using abelian varieties to improve pairing-based cryptography (Q1027984) (← 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)
• Cover attacks for elliptic curves with cofactor two (Q1791663) (← links)
• Elliptic curve discrete logarithm problem over small degree extension fields (Q1946599) (← links)
• New results on quasi-subfield polynomials (Q1979951) (← 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)
• Solving degree, last fall degree, and related invariants (Q2156375) (← links)
• Quasi-subfield polynomials and the elliptic curve discrete logarithm problem (Q2191201) (← links)
• Solving multivariate polynomial systems and an invariant from commutative algebra (Q2232206) (← links)
• Koblitz curves over quadratic fields (Q2318090) (← links)
• Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
• A simple method for obtaining relations among factor basis elements for special hyperelliptic curves (Q2358420) (← links)
• Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
• Cryptographic implications of Hess' generalized GHS attack (Q2502169) (← links)
• The complexity of solving Weil restriction systems (Q2689195) (← links)
• Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two (Q2945401) (← links)
• A generic approach to searching for Jacobians (Q3055104) (← links)
• A Variant of the F4 Algorithm (Q3073717) (← links)
• On the discrete logarithm problem in class groups of curves (Q3081294) (← links)
• On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields (Q3392902) (← links)
• A Note on Diem’s Proof (Q3454601) (← links)
• Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP (Q3457129) (← links)
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
• Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
• Faster Halvings in Genus 2 (Q3644189) (← links)
• The Supersingular Isogeny Problem in Genus 2 and Beyond (Q5041219) (← links)
• Semi-Regular Sequences and Other Random Systems of Equations (Q5048628) (← links)
• A SAT-Based Approach for Index Calculus on Binary Elliptic Curves (Q5048971) (← links)
• Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves (Q5246849) (← links)
• Field extensions and index calculus on algebraic curves (Q5346826) (← links)
• On the complexity of computing Gröbner bases for weighted homogeneous systems (Q5963397) (← links)
• Cover attacks for elliptic curves over cubic extension fields (Q6176272) (← links)