Ordinary Abelian varieties having small embedding degree

DOI10.1016/J.FFA.2007.02.003zbMATH Open1161.11017OpenAlexW2034710402WikidataQ61914062 ScholiaQ61914062MaRDI QIDQ2467316FDOQ2467316

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)

Cites Work

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

Cited In (26)

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

Uses Software

• Magma

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467316)