Optimal pairing computation over families of pairing-friendly elliptic curves

DOI10.1007/S00200-011-0146-4MaRDI QIDQ429764zbMATHOpenAlexFDO

Authors Soo-Kyung Eom, Hyang-Sook Lee, Cheol-Min Park

Publication date 20 June 2012

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-011-0146-4

zbMATH Keywords

elliptic curvesAte pairingoptimal pairingTate pairingpairing computationpairing-friendly curvesR-ate pairing

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
• Computing bilinear pairings on elliptic curves with automorphisms
• A taxonomy of pairing-friendly elliptic curves
• Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
• The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets

Cites work

• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• A taxonomy of pairing-friendly elliptic curves
• Advances in Cryptology - ASIACRYPT 2003
• Ate Pairing on Hyperelliptic Curves
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Efficient pairing computation on supersingular abelian varieties
• Elliptic curves suitable for pairing based cryptography
• Optimal Pairings
• Optimised Versions of the Ate and Twisted Ate Pairings
• Pairing Lattices
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Eta Pairing Revisited
• The Weil pairing, and its efficient calculation

Cited in

(9)

• An optimal Tate pairing computation using Jacobi quartic elliptic curves
• Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
• scientific article; zbMATH DE number 5951445 (Why is no real title available?)
• Polynomial generating pairing and its criterion for optimal pairing
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\)
• Heuristics on pairing-friendly elliptic curves
• Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2

This page was built for publication: Optimal pairing computation over families of pairing-friendly elliptic curves

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