Bilinear pairings computation using the extended double-base chains algorithm

Citation

Mohammed Ismail, Abdulwahed and Md. Said, Mohamad Rushdan and Mohd Atan, Kamel Ariffin and Rakhimov, Isamiddin Sattarovich (2010) Bilinear pairings computation using the extended double-base chains algorithm. International Journal Mathematical Analysis, 4 (17-20). pp. 929-941. ISSN 1312-8876; ESSN: 1314-7579

Abstract

Elliptic curve (EC) pairings have been the focus of attention of researchers and cryptographers, especially after identity-based cryptosystems(IBC) were proposed in 2001. The Weil and Tate pairing is considered as the most important pairings used in cryptographical protocols and their applications. The computation efficiency of the Weil and Tate pairings mainly depends on the efficiency of the EC scalar multplications algorithms used. In this paper, we compute the Tate pairing using multi-base number representation(MBNR) system in scalar multiplication instead of using binary representation as used in Miller’s algorithm and in the double-base (DB) chain used by Changan Zhao et al. We show that using doubling, tripling and quintupling in scalar multiplication, computation of the Tate pairing and its applications can be significantly enhanced.

Download File

Preview

PDF (Abstract)
Bilinear pairings computation using the extended double.pdf
Download (177kB) | Preview

Official URL or Download Paper: http://www.m-hikari.com/ijma/ijma-2010/ijma-17-20-...

Additional Metadata

Item Type:	Article
Divisions:	Faculty of Science Institute for Mathematical Research
Publisher:	Hikari
Keywords:	Bilinear pairing; Tate pairing; Miller's algorithm; Elliptic curves cryptography; Multi-number representation system
Depositing User:	Nurul Ainie Mokhtar
Date Deposited:	08 Jun 2015 03:57
Last Modified:	20 Oct 2015 23:56
URI:	http://psasir.upm.edu.my/id/eprint/13394
Statistic Details:	View Download Statistic

Actions (login required)

View Item