Cover Image

Bilinear pairings computation using the extended double-base chains algorithm

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....

Full description

Saved in:
Bibliographic Details
Main Authors: Mohammed Ismail, Abdulwahed, Md. Said, Mohamad Rushdan, Mohd Atan, Kamel Ariffin, Rakhimov, Isamiddin Sattarovich
Format: Article
Language:English
Published: Hikari 2010
Online Access:http://psasir.upm.edu.my/id/eprint/13394/1/Bilinear%20pairings%20computation%20using%20the%20extended%20double.pdf
http://psasir.upm.edu.my/id/eprint/13394/
http://www.m-hikari.com/ijma/ijma-2010/ijma-17-20-2010/index.html
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.13394
record_format eprints
spelling my.upm.eprints.133942015-10-20T23:56:20Z http://psasir.upm.edu.my/id/eprint/13394/ Bilinear pairings computation using the extended double-base chains algorithm Mohammed Ismail, Abdulwahed Md. Said, Mohamad Rushdan Mohd Atan, Kamel Ariffin Rakhimov, Isamiddin Sattarovich 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. Hikari 2010 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/13394/1/Bilinear%20pairings%20computation%20using%20the%20extended%20double.pdf 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 http://www.m-hikari.com/ijma/ijma-2010/ijma-17-20-2010/index.html
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description 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.
format Article
author Mohammed Ismail, Abdulwahed
Md. Said, Mohamad Rushdan
Mohd Atan, Kamel Ariffin
Rakhimov, Isamiddin Sattarovich
spellingShingle Mohammed Ismail, Abdulwahed
Md. Said, Mohamad Rushdan
Mohd Atan, Kamel Ariffin
Rakhimov, Isamiddin Sattarovich
Bilinear pairings computation using the extended double-base chains algorithm
author_facet Mohammed Ismail, Abdulwahed
Md. Said, Mohamad Rushdan
Mohd Atan, Kamel Ariffin
Rakhimov, Isamiddin Sattarovich
author_sort Mohammed Ismail, Abdulwahed
title Bilinear pairings computation using the extended double-base chains algorithm
title_short Bilinear pairings computation using the extended double-base chains algorithm
title_full Bilinear pairings computation using the extended double-base chains algorithm
title_fullStr Bilinear pairings computation using the extended double-base chains algorithm
title_full_unstemmed Bilinear pairings computation using the extended double-base chains algorithm
title_sort bilinear pairings computation using the extended double-base chains algorithm
publisher Hikari
publishDate 2010
url http://psasir.upm.edu.my/id/eprint/13394/1/Bilinear%20pairings%20computation%20using%20the%20extended%20double.pdf
http://psasir.upm.edu.my/id/eprint/13394/
http://www.m-hikari.com/ijma/ijma-2010/ijma-17-20-2010/index.html
_version_ 1643825318800130048
score 13.211869

Similar Items