Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves

DOI10.1016/j.ffa.2014.12.007zbMath1392.11095OpenAlexW2036360318WikidataQ57437136 ScholiaQ57437136MaRDI QIDQ2348162

Hyang-Sook Lee, Hoon Hong, Eun Jeong Lee

Publication date: 10 June 2015

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

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

zbMATH Keywords

elliptic curvecyclotomic polynomialpairing-based cryptosystem

Mathematics Subject Classification ID

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

Related Items

Cyclotomic coefficients: gaps and jumps

Uses Software

• PandA
• EAGL

Cites Work

• Unnamed Item
• A one round protocol for tripartite Diffie-Hellman
• Short signatures from the Weil pairing
• The Weil pairing, and its efficient calculation
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• Elliptic curves suitable for pairing based cryptography
• Analysis of Optimum Pairing Products at High Security Levels
• The Eta Pairing Revisited
• New Software Speed Records for Cryptographic Pairings
• Pairing Lattices
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Identity-Based Encryption from the Weil Pairing
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Optimal Pairings
• Efficient Identity-Based Encryption Without Random Oracles
• Theory of Cryptography
• EAGL: An Elliptic Curve Arithmetic GPU-Based Library for Bilinear Pairing
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves