Speeding up Ate pairing computation in affine coordinates

DOI10.1007/978-3-642-37682-5_19MaRDI QIDQ4922873zbMATH OpenOpenAlexFDO

Authors Duc-Phong Le, Chik How Tan

Publication date 4 June 2013

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-37682-5_19

zbMATH Keywords

affine coordinatesate pairingcubic twisted curvesfinal exponentiationpairing computationpairing-friendly elliptic curves

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• An analysis of affine coordinates for pairing computation
• Faster pairing computations on curves with high-degree twists
• Accelerating twisted Ate pairing with Frobenius map, small scalar multiplication, and multi-pairing
• Pairing-friendly twisted Hessian curves
• Faster computation of the Tate pairing

Cited in

(10)

• Choosing and generating parameters for pairing implementation on BN curves
• Faster Ate pairing computation on Selmer's model of elliptic curves
• An analysis of affine coordinates for pairing computation
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Avoiding full extension field arithmetic in pairing computations
• Faster pairing computations on curves with high-degree twists
• Accelerating twisted Ate pairing with Frobenius map, small scalar multiplication, and multi-pairing
• Affine pairings on ARM
• Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve
• Optimal ate pairing on elliptic curves with embedding degree 9, 15 and 27

This page was built for publication: Speeding up Ate pairing computation in affine coordinates

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