Polynomial generating pairing and its criterion for optimal pairing

DOI10.1007/s00200-014-0225-4zbMath1342.11096OpenAlexW2031201970MaRDI QIDQ744018

Cheol-Min Park, Hyang-Sook Lee, Eun Jeong Lee

Publication date: 2 October 2014

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-014-0225-4

zbMATH Keywords

optimal pairingpairing-friendly elliptic curvepolynomial generating pairing

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20)

Uses Software

• Magma
• ECPP

Cites Work

• 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
• 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
• Elliptic Curves and Primality Proving
• The Eta Pairing Revisited
• Pairing Lattices
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Optimal Pairings
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial generating pairing and its criterion for optimal pairing