Faster computation of the Tate pairing
From MaRDI portal
Publication:2430985
DOI10.1016/J.JNT.2010.05.013zbMATH Open1222.14069arXiv0904.0854OpenAlexW2122825463MaRDI QIDQ2430985FDOQ2430985
Authors: Christophe Arène, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler 
Publication date: 8 April 2011
Published in: Journal of Number Theory (Search for Journal in Brave)
Abstract: This paper proposes new explicit formulas for the doubling and addition step in Miller's algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric interpretation of the group law on Edwards curves by presenting the functions which arise in the addition and doubling. Computing the coefficients of the functions and the sum or double of the points is faster than with all previously proposed formulas for pairings on Edwards curves. They are even competitive with all published formulas for pairing computation on Weierstrass curves. We also speed up pairing computation on Weierstrass curves in Jacobian coordinates. Finally, we present several examples of pairing-friendly Edwards curves.
Full work available at URL: https://arxiv.org/abs/0904.0854
Recommendations
- Fast Tate pairing computation on twisted Jacobi intersections curves
- Information Security and Privacy
- scientific article; zbMATH DE number 1950619
- Topics in Cryptology – CT-RSA 2005
- Efficient Tate pairing computation using double-base chains
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Efficient Algorithm for Tate Pairing of Composite Order
- Faster Ate pairing computation on Selmer's model of elliptic curves
- Faster pairing computation on genus \(2\) hyperelliptic curves
Cryptography (94A60) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- A taxonomy of pairing-friendly elliptic curves
- Title not available (Why is that?)
- Pairing-Friendly Elliptic Curves of Prime Order
- Progress in cryptology -- AFRICACRYPT 2008. First international conference on cryptology in Africa, Casablanca, Morocco, June 11--14, 2008. Proceedings
- Twisted Edwards Curves
- Faster Addition and Doubling on Elliptic Curves
- The Weil pairing, and its efficient calculation
- Faster pairing computations on curves with high-degree twists
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- A normal form for elliptic curves
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Title not available (Why is that?)
- Another Approach to Pairing Computation in Edwards Coordinates
- Title not available (Why is that?)
- Public key cryptography -- PKC 2010. 13th international conference on practice and theory in public key cryptography, Paris, France, May 26--28, 2010. Proceedings
- Advances in cryptology - CRYPTO 2002. 22nd annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2002. Proceedings
- Selected areas in cryptography. 12th international workshop, SAC 2005, Kingston, ON, Canada, August 11--12, 2005. Revised selected papers.
- Pairing-based cryptography -- Pairing 2009. Third international conference Palo Alto, CA, USA, August 12--14, 2009. Proceedings
- Progress in cryptology -- INDOCRYPT 2008. 9th international conference on cryptology in India, Kharagpur, India, December 14--17, 2008. Proceedings
- Pairing-based cryptography -- Pairing 2008. Second international conference, Egham, UK, September 1--3, 2008. Proceedings
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Information security and cryptology -- ICISC 2004. 7th international conference, Seoul, Korea, December 2--3, 2004. Revised Selected Papers
- Title not available (Why is that?)
- Advances in cryptology -- ASIACRYPT 2008. 14th international conference on the theory and application of cryptology and information security, Melbourne, Australia, December 7--11, 2008. Proceedings
- Title not available (Why is that?)
- Efficient implementation of pairing-based cryptosystems
- Ordinary Abelian varieties having small embedding degree
- Title not available (Why is that?)
- Advances in cryptology -- ASIACRYPT 2007. 13th international conference on the theory and application of cryptology and information security, Kuching, Malaysia, December 2-6, 2007. Proceedings
Cited In (45)
- An optimal Tate pairing computation using Jacobi quartic elliptic curves
- Efficient pairing computation on elliptic curves in Hessian form
- Fast Tate pairing computation on twisted Jacobi intersections curves
- Tate pairing computation on Jacobi's elliptic curves
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Efficient Algorithm for Tate Pairing of Composite Order
- Compression for trace zero points on twisted Edwards curves
- Improved sieving on algebraic curves
- On near prime-order elliptic curves with small embedding degrees
- Pairing-friendly twisted Hessian curves
- Faster Ate pairing computation on Selmer's model of elliptic curves
- Speeding up Ate pairing computation in affine coordinates
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
- The pairing computation on Edwards curves
- Identity-based undetachable digital signature for mobile agents in electronic commerce
- Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing
- Formal Proof of the Group Law for Edwards Elliptic Curves
- Tate pairing computation on generalized Hessian curves
- Twisted Hessian curves
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Deterministic encoding into twisted Edwards curves
- Title not available (Why is that?)
- Exp function for Edwards curves over local fields
- On the near prime-order MNT curves
- Efficient self-pairing on ordinary elliptic curves
- The pairing computation on binary Edwards curves
- Further refinements of Miller's algorithm on Edwards curves
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Another Approach to Pairing Computation in Edwards Coordinates
- Efficient pairing computation with theta functions
- Huff's model for elliptic curves
- Faster pairing computations on curves with high-degree twists
- Another elliptic curve model for faster pairing computation
- Mean value formulas for twisted Edwards curves
- An analysis of affine coordinates for pairing computation
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Pairing computation on Edwards curves with high-degree twists
- Refinement of Miller's algorithm over Edwards curves
- Faster Pairings on Special Weierstrass Curves
- Fast simplifications for Tarski formulas
- Title not available (Why is that?)
- A complete set of addition laws for incomplete Edwards curves
- Parallelizing pairings on Hessian elliptic curves
- Fuzzy perspective of online games by using cryptography and cooperative game theory
- Elliptic curves in Huff’s model
Uses Software
This page was built for publication: Faster computation of the Tate pairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430985)
