Ordinary Abelian varieties having small embedding degree

DOI10.1016/j.ffa.2007.02.003zbMath1161.11017OpenAlexW2034710402WikidataQ61914062 ScholiaQ61914062MaRDI QIDQ2467316

Steven D. Galbraith, P. C. Valença, James McKee

Publication date: 21 January 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2007.02.003

zbMATH Keywords

elliptic curvespairings

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (23)

On the near prime-order MNT curves ⋮ Generating pairing-friendly elliptic curve parameters using sparse families ⋮ Heuristics on pairing-friendly abelian varieties ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ A survey of elliptic curves for proof systems ⋮ Elliptic curves withj= 0,1728 and low embedding degree ⋮ Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ Faster computation of the Tate pairing ⋮ Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields ⋮ On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials ⋮ Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction ⋮ On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields ⋮ Generating Pairing-Friendly Curves with the CM Equation of Degree 1 ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates ⋮ On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant ⋮ Note on families of pairing-friendly elliptic curves with small embedding degree

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• The Magma algebra system. I: The user language
• Efficient pairing computation on supersingular abelian varieties
• Generating more MNT elliptic curves
• Elliptic curves suitable for pairing based cryptography
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Ordinary Abelian varieties having small embedding degree