A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
From MaRDI portal
Publication:4292072
DOI10.2307/2153546zbMath0813.14045OpenAlexW2094556471MaRDI QIDQ4292072
Publication date: 8 June 1995
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2153546
Arithmetic ground fields for curves (14H25) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05) Picard groups (14C22)
Related Items
Multiradical isogenies, Pairing-based cryptography on elliptic curves, Weight distributions of geometric Goppa codes, Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields, Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves, Constructing Isogenies between Elliptic Curves Over Finite Fields, Efficient hash maps to \(\mathbb{G}_2\) on BLS curves, On the near prime-order MNT curves, A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Efficient pairing computation on supersingular abelian varieties, Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree, Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem, Easy Decision Diffie-Hellman Groups, The generalized Weil pairing and the discrete logarithm problem on elliptic curves, On Near Prime-Order Elliptic Curves with Small Embedding Degrees, Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree, Scalable zero knowledge via cycles of elliptic curves, Fault attacks on hyperelliptic curve discrete logarithm problem over binary field, DiSSECT: distinguisher of standard and simulated elliptic curves via traits, Weak instances of class group action based cryptography via self-pairings, Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, Revisiting cycles of pairing-friendly elliptic curves, Faster pairing computation on genus \(2\) hyperelliptic curves, A round-optimal three-party ID-based authenticated key agreement protocol, Elliptic curve cryptography: the serpentine course of a paradigm shift, Elliptic curve discrete logarithm problem over small degree extension fields, Optimal pairing computation over families of pairing-friendly elliptic curves, Improved Pollard rho method for computing discrete logarithms over finite extension fields, Heuristics of the Cocks-Pinch method, The discrete logarithm problem from a local duality perspective, Unnamed Item, Parallelizing pairings on Hessian elliptic curves, On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$, Security weaknesses of a signature scheme and authenticated key agreement protocols, Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ, A Weil pairing on the \(p\)-torsion of ordinary elliptic curves over \(K[\varepsilon\)], Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield, Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\), Local Duality and the Discrete Logarithm Problem, ON BOUNDS FOR BALANCED EMBEDDING DEGREE, Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝, Ordinary Abelian varieties having small embedding degree, RNS arithmetic in 𝔽 pk and application to fast pairing computation, Efficient Tate pairing computation using double-base chains, Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five, Algebraic curves and cryptography, Efficient Self-pairing on Ordinary Elliptic Curves, On Cycles of Pairing-Friendly Elliptic Curves, Provably secure non-interactive key distribution based on pairings, A taxonomy of pairing-friendly elliptic curves, Supersingular hyperelliptic curves of genus 2 over finite fields, Efficient algorithms for Koblitz curves over fields of characteristic three, Koblitz curve cryptosystems, Pairing Computation on Twisted Edwards Form Elliptic Curves, Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms, A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$, The Tate pairing for abelian varieties over finite fields, Cryptographic implications of Hess' generalized GHS attack, Ramanujan's class invariants and their use in elliptic curve cryptography, On the asymptotic effectiveness of Weil descent attacks, Simplified pairing computation and security implications, An Analysis of the Vector Decomposition Problem, Bandwidth-efficient attribute-based key-insulated signatures with message recovery, On the efficient generation of prime-order elliptic curves, Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography, A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties, Polynomial generating pairing and its criterion for optimal pairing, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, Hensel-lifting torsion points on Jacobians and Galois representations, On bilinear structures on divisor class groups, Global Duality, Signature Calculus and the Discrete Logarithm Problem, Linearizing torsion classes in the Picard group of algebraic curves over finite fields, Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates, The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences, Using abelian varieties to improve pairing-based cryptography, A self-pairing map and its applications to cryptography, On the complexity of the discrete logarithm and Diffie-Hellman problems, Computing in Picard groups of projective curves over finite fields, Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\), Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems, A group key agreement protocol from pairings, The GN-authenticated key agreement, Still wrong use of pairings in cryptography, Constructive and destructive facets of Weil descent on elliptic curves, On the discrete logarithm in the divisor class group of curves, Bitcoin security with a twisted Edwards curve, A Brief History of Pairings, Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
