Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2

DOI10.1007/978-3-642-25516-8_19zbMath1282.14047OpenAlexW1886649036MaRDI QIDQ3104703

Xu-Sheng Zhang, Dong-Dai Lin

Publication date: 16 December 2011

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_19

zbMATH Keywords

Miller's algorithmcomposite-order pairingOmega pairing latticesRSA ring

Mathematics Subject Classification ID

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

Uses Software

• EFD

Cites Work

• Unnamed Item
• Unnamed Item
• Computing bilinear pairings on elliptic curves with automorphisms
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• The Weil pairing, and its efficient calculation
• A taxonomy of pairing-friendly elliptic curves
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• Faster computation of the Tate pairing
• Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
• A Variant of Miller’s Formula and Algorithm
• The Eta Pairing Revisited
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• Pairing Lattices
• Optimal Pairings
• Theory of Cryptography
• Cryptography and Coding
• Cryptography and Coding
• Algorithmic Number Theory

This page was built for publication: Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2