Optimal pairing computation over families of pairing-friendly elliptic curves

DOI10.1007/s00200-011-0146-4zbMath1266.94021OpenAlexW2048325573MaRDI QIDQ429764

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

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 curvesTate pairingAte pairingoptimal pairingpairing computationpairing-friendly curvesR-ate pairing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The Weil pairing, and its efficient calculation
• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• Elliptic curves suitable for pairing based cryptography
• The Eta Pairing Revisited
• Pairing Lattices
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Optimal Pairings
• Ate Pairing on Hyperelliptic Curves
• Optimised Versions of the Ate and Twisted Ate Pairings
• Advances in Cryptology - ASIACRYPT 2003

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