Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields

DOI10.1007/11496618_13zbMath1133.94310OpenAlexW1845108744MaRDI QIDQ5450899

Sanjit Chatterjee, Palash Sarkar, Rana Barua

Publication date: 17 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496618_13

zbMATH Keywords

Tate pairingefficient implementationJacobian coordinate

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Related Items (8)

Computing bilinear pairings on elliptic curves with automorphisms ⋮ Faster computation of the Tate pairing ⋮ Pairing Computation on Twisted Edwards Form Elliptic Curves ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ Computing pairings using \(x\)-coordinates only ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates ⋮ Another Approach to Pairing Computation in Edwards Coordinates

This page was built for publication: Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields