Faster computation of the Tate pairing
From MaRDI portal
Publication:2430985
DOI10.1016/j.jnt.2010.05.013zbMath1222.14069arXiv0904.0854OpenAlexW2122825463MaRDI QIDQ2430985
Christophe Ritzenthaler, Christophe Arène, Michael Naehrig, Tanja Lange
Publication date: 8 April 2011
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.0854
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Identity-based undetachable digital signature for mobile agents in electronic commerce ⋮ Formal Proof of the Group Law for Edwards Elliptic Curves ⋮ Further refinements of Miller's algorithm on Edwards curves ⋮ On the near prime-order MNT curves ⋮ Pairing Computation on Edwards Curves with High-Degree Twists ⋮ Twisted Hessian Curves ⋮ Improved Sieving on Algebraic Curves ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ A complete set of addition laws for incomplete Edwards curves ⋮ Unnamed Item ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ The pairing computation on Edwards curves ⋮ An optimal Tate pairing computation using Jacobi quartic elliptic curves ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ Elliptic curves in Huff’s model ⋮ Huff’s Model for Elliptic Curves ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties ⋮ Deterministic Encoding into Twisted Edwards Curves ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology - CRYPTO 2002. 22nd annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2002. Proceedings
- Progress in cryptology -- AFRICACRYPT 2008. First international conference on cryptology in Africa, Casablanca, Morocco, June 11--14, 2008. Proceedings
- Pairing-based cryptography -- Pairing 2008. Second international conference, Egham, UK, September 1--3, 2008. Proceedings
- 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
- Public key cryptography -- PKC 2010. 13th international conference on practice and theory in public key cryptography, Paris, France, May 26--28, 2010. Proceedings
- Efficient implementation of pairing-based cryptosystems
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- 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
- Selected areas in cryptography. 12th international workshop, SAC 2005, Kingston, ON, Canada, August 11--12, 2005. Revised selected papers.
- 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
- Ordinary Abelian varieties having small embedding degree
- Information security and cryptology -- ICISC 2004. 7th international conference, Seoul, Korea, December 2--3, 2004. Revised Selected Papers
- Twisted Edwards Curves
- Faster Pairing Computations on Curves with High-Degree Twists
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- Pairing-Friendly Elliptic Curves of Prime Order
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Another Approach to Pairing Computation in Edwards Coordinates
