Efficient Tate pairing computation using double-base chains

DOI10.1007/s11432-008-0070-9zbMath1210.94098OpenAlexW2036165685MaRDI QIDQ954437

Fangguo Zhang, Jiwu Huang, Chanan Zhao

Publication date: 10 November 2008

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-008-0070-9

zbMATH Keywords

elliptic curvespublic key cryptographyTate pairingdouble-base chains

Mathematics Subject Classification ID

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

Related Items (2)

Double-base chains for scalar multiplications on elliptic curves ⋮ Lower bounds on the lengths of double-base representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient pairing computation on supersingular abelian varieties
• Trading inversions for multiplications in elliptic curve cryptography
• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• The Eta Pairing Revisited
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Refinements of Miller's algorithm for computing the Weil/Tate pairing
• Public Key Cryptography – PKC 2004
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Efficient Tate pairing computation using double-base chains