An analysis of affine coordinates for pairing computation

DOI10.1007/978-3-642-17455-1_1MaRDI QIDQ3059636zbMATHOpenAlexFDO

Authors Michael Naehrig, Kristin Lauter, Peter L. Montgomery

Publication date 26 November 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-17455-1_1

zbMATH Keywords

pairing computationpairing productsoptimal ate pairingaffine coordinatesfinite field inversionsmultiple pairingspairing cost

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

• Speeding up Ate pairing computation in affine coordinates
• Affine pairings on ARM
• The realm of the pairings
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
• Faster explicit formulas for computing pairings over ordinary curves

Cites work

• 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 2086895 (Why is no real title available?)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A taxonomy of pairing-friendly elliptic curves
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Elliptic Curve Cryptography
• Another Approach to Pairing Computation in Edwards Coordinates
• Constructing tower extensions of finite fields for implementation of pairing-based cryptography
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• Efficient implementation of pairing-based cryptosystems
• Efficient pairing computation on supersingular abelian varieties
• Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
• Faster Pairings on Special Weierstrass Curves
• Faster computation of the Tate pairing
• Faster pairing computations on curves with high-degree twists
• Faster squaring in the cyclotomic subgroup of sixth degree extensions
• Five, six, and seven-term Karatsuba-like formulae
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
• New Software Speed Records for Cryptographic Pairings
• On Software Parallel Implementation of Cryptographic Pairings
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Optimal Pairings
• Optimal tower fields
• Pairing-Friendly Elliptic Curves of Prime Order
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Eta Pairing Revisited
• The Weil pairing, and its efficient calculation
• Topics in Cryptology – CT-RSA 2005

Cited in

(11)

• Computing pairings using \(x\)-coordinates only
• scientific article; zbMATH DE number 4047161 (Why is no real title available?)
• Affine pairings on ARM
• Speeding up Ate pairing computation in affine coordinates
• Group law computations on Jacobians of hyperelliptic curves
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Scalable zero knowledge via cycles of elliptic curves
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
• Beta Weil pairing revisited
• Choosing and generating parameters for pairing implementation on BN curves
• On the efficient implementation of pairing-based protocols

Describes a project that uses

Uses Software

• EFD

This page was built for publication: An analysis of affine coordinates for pairing computation

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