Computing fixed argument pairings with the elliptic net algorithm

The pairing-based cryptosystem was proposed in 2001, and it provides efficient implementations of identity-based encryption (IBE) and attribute-based encryption (ABE). In 2010, Costello and Stebila introduced the concept of fixed argument pairing, which can be applied to many applications of pairing...

Full description

Saved in:
Bibliographic Details
Published inJSIAM Letters Vol. 6; pp. 69 - 72
Main Authors Liu, Yang, Kanayama, Naoki, Saito, Kazutaka, Teruya, Tadanori, Uchiyama, Shigenori, Okamoto, Eiji
Format Journal Article
LanguageEnglish
Published The Japan Society for Industrial and Applied Mathematics 2014
Subjects
elliptic net algorithm
fixed argument pairing
pairing-based cryptography
Online AccessGet full text

Cover

More Information
Summary:The pairing-based cryptosystem was proposed in 2001, and it provides efficient implementations of identity-based encryption (IBE) and attribute-based encryption (ABE). In 2010, Costello and Stebila introduced the concept of fixed argument pairing, which can be applied to many applications of pairings, and, to compute these pairings, they proposed an efficient algorithm based on the Miller algorithm. In this paper, we propose a method for computing fixed argument pairings, based on the elliptic net method proposed by Stange.
ISSN:1883-0609
1883-0617
DOI:10.14495/jsiaml.6.69