An analysis of affine coordinates for pairing computation

DOI10.1007/978-3-642-17455-1_1zbMATH Open1287.94079OpenAlexW2120631585MaRDI QIDQ3059636FDOQ3059636

Michael Naehrig, Peter L. Montgomery, Kristin Lauter

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

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

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)

Cites Work

• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• 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
• Pairing-Friendly Elliptic Curves of Prime Order
• Faster computation of the Tate pairing
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Weil pairing, and its efficient calculation
• Efficient pairing computation on supersingular abelian varieties
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• The Eta Pairing Revisited
• Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
• Faster Pairing Computations on Curves with High-Degree Twists
• Optimal Pairings
• Advances in Elliptic Curve Cryptography
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Five, six, and seven-term Karatsuba-like formulae
• Title not available (Why is that?)
• Another Approach to Pairing Computation in Edwards Coordinates
• Optimal tower fields
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• Faster Pairings on Special Weierstrass Curves
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Title not available (Why is that?)
• Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
• Topics in Cryptology – CT-RSA 2005
• On Software Parallel Implementation of Cryptographic Pairings
• Title not available (Why is that?)
• Efficient implementation of pairing-based cryptosystems
• Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
• New Software Speed Records for Cryptographic Pairings
• Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic

Cited In (9)

• Computing pairings using \(x\)-coordinates only
• On the Efficient Implementation of Pairing-Based Protocols
• Choosing and generating parameters for pairing implementation on BN curves
• Title not available (Why is that?)
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
• Beta Weil pairing revisited
• Group Law Computations on Jacobians of Hyperelliptic Curves
• Scalable zero knowledge via cycles of elliptic curves
• Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

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)