Pages that link to "Item:Q4292072"
From MaRDI portal
The following pages link to A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves (Q4292072):
Displaying 40 items.
- Computing in Picard groups of projective curves over finite fields (Q2840629) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- On Near Prime-Order Elliptic Curves with Small Embedding Degrees (Q2947154) (← links)
- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree (Q2947157) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- Local Duality and the Discrete Logarithm Problem (Q3005591) (← links)
- RNS arithmetic in 𝔽 pk and application to fast pairing computation (Q3015225) (← links)
- On the asymptotic effectiveness of Weil descent attacks (Q3056341) (← links)
- Global Duality, Signature Calculus and the Discrete Logarithm Problem (Q3091979) (← links)
- On the relation between Brauer groups and discrete logarithms (Q3421478) (← links)
- Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ (Q3537423) (← links)
- Discrete Logarithms, Duality, and Arithmetic in Brauer Groups (Q3545356) (← links)
- Pairing Computation on Twisted Edwards Form Elliptic Curves (Q3600505) (← links)
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms (Q3600509) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (Q3644190) (← links)
- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences (Q3644209) (← links)
- Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems (Q4216666) (← links)
- On the discrete logarithm in the divisor class group of curves (Q4235519) (← links)
- Weight distributions of geometric Goppa codes (Q4252942) (← links)
- Constructing Isogenies between Elliptic Curves Over Finite Fields (Q4267918) (← links)
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝 (Q4372702) (← links)
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree (Q4827599) (← links)
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem (Q4827628) (← links)
- Easy Decision Diffie-Hellman Groups (Q4827630) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) (← links)
- Hensel-lifting torsion points on Jacobians and Galois representations (Q5216734) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- Simplified pairing computation and security implications (Q5443538) (← links)
- An Analysis of the Vector Decomposition Problem (Q5445460) (← links)
- On Cycles of Pairing-Friendly Elliptic Curves (Q5742695) (← links)
- Bitcoin security with a twisted Edwards curve (Q5865692) (← links)
- Multiradical isogenies (Q5880203) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- On the efficient generation of prime-order elliptic curves (Q5962222) (← links)
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits (Q6103100) (← links)
- Solving modular cubic equations with Coppersmith's method (Q6543269) (← links)
- Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees (Q6544474) (← links)
