Computing pairings using x-coordinates only

DOI10.1007/S10623-008-9233-3MaRDI QIDQ1009121zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Steven D. Galbraith, Xibin Lin

Publication date 31 March 2009

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-008-9233-3

Mathematics Subject Classification ID

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

Recommendations

• An analysis of affine coordinates for pairing computation
• Another Approach to Pairing Computation in Edwards Coordinates
• scientific article; zbMATH DE number 637475
• scientific article; zbMATH DE number 4047161
• Computation of pair placement of geometric objects
• An algorithm for finding homogeneous pairs
• Topics in Cryptology – CT-RSA 2005
• On Compressible Pairings and Their Computation
• scientific article; zbMATH DE number 9720

Cites work

• scientific article; zbMATH DE number 51845 (Why is no real title available?)
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 1950619 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• A one round protocol for tripartite Diffie-Hellman
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
• Efficient pairing computation on supersingular abelian varieties
• Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Information Security and Privacy
• On Compressible Pairings and Their Computation
• On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
• Short signatures from the Weil pairing
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Eta Pairing Revisited
• The Magma algebra system. I: The user language
• The Tate Pairing Via Elliptic Nets
• Topics in Cryptology – CT-RSA 2005

Cited in

(7)

• Effective pairings in isogeny-based cryptography
• Computing bilinear pairings on elliptic curves with automorphisms
• An optimal representation for the trace zero subgroup
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• Point compression for the trace zero subgroup over a small degree extension field
• Optimal bandwidth for elliptic curves defined over \(\text{GF}(2^n)\)
• Point compression and coordinate recovery for Edwards curves over finite field

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Computing pairings using \(x\)-coordinates only

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009121)