Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism

DOI10.1007/11596219_21zbMath1153.94429OpenAlexW1498836632MaRDI QIDQ5450993

No author found.

Publication date: 17 March 2008

Published in: Progress in Cryptology - INDOCRYPT 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11596219_21

zbMATH Keywords

pairing-based cryptosystemsTate pairing implementation

Mathematics Subject Classification ID

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

Related Items (7)

Computing bilinear pairings on elliptic curves with automorphisms ⋮ How to Make the Cramer-Shoup Cryptosystem Secure Against Linear Related-Key Attacks ⋮ Pairing Lattices ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Computing pairings using \(x\)-coordinates only ⋮ Faster Pairings on Special Weierstrass Curves ⋮ Direct chosen-ciphertext secure identity-based key encapsulation without random oracles

This page was built for publication: Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism