An Analysis of Affine Coordinates for Pairing Computation
DOI10.1007/978-3-642-17455-1_1zbMath1287.94079OpenAlexW2120631585MaRDI QIDQ3059636
Michael Naehrig, Peter L. Montgomery, Kristin E. 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
pairing computationpairing productsoptimal ate pairingaffine coordinatesfinite field inversionsmultiple pairingspairing cost
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- Efficient implementation of pairing-based cryptosystems
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Efficient pairing computation on supersingular abelian varieties
- Faster computation of the Tate pairing
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Faster Pairings on Special Weierstrass Curves
- Five, six, and seven-term Karatsuba-like formulae
- Optimal tower fields
- The Eta Pairing Revisited
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- Faster Pairing Computations on Curves with High-Degree Twists
- Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
- New Software Speed Records for Cryptographic Pairings
- On Software Parallel Implementation of Cryptographic Pairings
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- Advances in Cryptology - EUROCRYPT 2004
- Pairing-Friendly Elliptic Curves of Prime Order
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Advances in Elliptic Curve Cryptography
- Another Approach to Pairing Computation in Edwards Coordinates
- Topics in Cryptology – CT-RSA 2005
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
This page was built for publication: An Analysis of Affine Coordinates for Pairing Computation