Efficient Tate pairing computation using double-base chains

DOI10.1007/S11432-008-0070-9zbMATH Open1210.94098OpenAlexW2036165685MaRDI QIDQ954437FDOQ954437

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

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

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)

Cites Work

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

Cited In (7)

• Efficient Algorithm for Tate Pairing of Composite Order
• Bilinear pairing computation using the extended double-base chains algorithm
• Title not available (Why is that?)
• Lower bounds on the lengths of double-base representations
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
• Double-base chains for scalar multiplications on elliptic curves
• Faster computation of the Tate pairing

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)