Efficient Tate pairing computation using double-base chains
type: Item
instance of: scholarly article
title: Efficient Tate pairing computation using double-base chains
zbMATH Open document ID: 1210.94098
author: Chanan Zhao
author: Fangguo Zhang
author: Jiwu Huang
published in: Science in China. Series F
publication date: 2008-11-10T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 5363726
zbMATH Keywords: public key cryptography
zbMATH Keywords: Tate pairing
zbMATH Keywords: elliptic curves
zbMATH Keywords: double-base chains
MaRDI profile type: Publication
full work available at URL: s11432-008-0070-9
OpenAlex ID: W2036165685
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
cites work: Q4783728
cites work: Efficient Identity-Based Encryption Without Random Oracles
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Q4474196
cites work: Public Key Cryptography – PKC 2004
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4409129
cites work: Q4737495
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Q4418548
cites work: Refinements of Miller's algorithm for computing the Weil/Tate pairing
cites work: Q4413332
cites work: Efficient pairing computation on supersingular abelian varieties
cites work: The Eta Pairing Revisited
cites work: On the low Hamming weight discrete logarithm problem for nonadjacent representations
cites work: Q3710637
cites work: Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
cites work: Trading inversions for multiplications in elliptic curve cryptography
DOI: 10.1007/S11432-008-0070-9
description: scientific article; zbMATH DE number 5363726