Faster Pairings on Special Weierstrass Curves

DOI10.1007/978-3-642-03298-1_7zbMath1248.94062OpenAlexW1843096854MaRDI QIDQ3392905

Craig Costello, Huseyin Hisil, Kenneth Koon-Ho Wong, Juan Manuel González Nieto, Colin A. Boyd

Publication date: 18 August 2009

Published in: Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/27635/1/Faster_pairings_on_special_Weierstrass_curves.pdf

zbMATH Keywords

elliptic curvesTate pairingMiller's algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

An Analysis of Affine Coordinates for Pairing Computation ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

Uses Software

• EFD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient implementation of pairing-based cryptosystems
• A one round protocol for tripartite Diffie-Hellman
• Short signatures from the Weil pairing
• 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
• Rational simplification modulo a polynomial ideal
• Fast Hashing to G 2 on Pairing-Friendly Curves
• The Eta Pairing Revisited
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Identity-Based Encryption from the Weil Pairing
• Pairing-Friendly Elliptic Curves of Prime Order
• Optimised Versions of the Ate and Twisted Ate Pairings
• Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
• Selected Areas in Cryptography
• Cryptography and Coding

This page was built for publication: Faster Pairings on Special Weierstrass Curves