Efficient Tate pairing computation using double-base chains

DOI10.1007/S11432-008-0070-9zbMATHOpenAlexMaRDI QIDQ954437FDO

Authors Chanan Zhao, Fangguo Zhang, Jiwu Huang

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)

Recommendations

• scientific article; zbMATH DE number 1942431
• Bilinear pairing computation using the extended double-base chains algorithm
• Efficient pairing computation on curves
• scientific article; zbMATH DE number 2086895
• scientific article; zbMATH DE number 1950619

Cites work

• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 1950619 (Why is no real title available?)
• scientific article; zbMATH DE number 1962162 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 2086895 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Advances in Cryptology - ASIACRYPT 2003
• 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
• Efficient pairing computation on supersingular abelian varieties
• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• Public Key Cryptography – PKC 2004
• Reducing elliptic curve logarithms to logarithms in a finite field
• Refinements of Miller's algorithm for computing the Weil/Tate pairing
• The Eta Pairing Revisited
• Trading inversions for multiplications in elliptic curve cryptography

Cited in

(10)

• Bilinear pairing computation using the extended double-base chains algorithm
• Lower bounds on the lengths of double-base representations
• Tower building technique on elliptic curve with embedding degree 18
• Double-base chains for scalar multiplications on elliptic curves
• Faster computation of the Tate pairing
• Multibase scalar multiplications in cryptographic pairings
• Computing optimal 2-3 chains for pairings
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• Efficient Algorithm for Tate Pairing of Composite Order
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields

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

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