Bilinear pairing computation using the extended double-base chains algorithm

MaRDI QIDQ4930534zbMATH OpenFDO

Authors Abdulwahed M. Ismail, Mohamad Rushdan Md. Said, Kamel Ariffin Mohd Atan, I. S. Rakhimov

Publication date 29 September 2010

Full work available at URL http://www.m-hikari.com/ijma/ijma-2010/ijma-17-20-2010/index.html

zbMATH Keywords

bilinear pairingselliptic curve cryptographyMiller's algoritmmulti-number representation systemTate pairing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient Tate pairing computation using double-base chains
• Multibase scalar multiplications in cryptographic pairings
• scientific article; zbMATH DE number 1950619
• Topics in Cryptology – CT-RSA 2005
• scientific article; zbMATH DE number 1962162

Cited in

(2)

• Multibase scalar multiplications in cryptographic pairings
• Efficient Tate pairing computation using double-base chains

This page was built for publication: Bilinear pairing computation using the extended double-base chains algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930534)