Efficient Algorithm for Tate Pairing of Composite Order

DOI10.1007/978-3-642-41383-4_13MaRDI QIDQ3190025zbMATH OpenOpenAlexFDO

Authors Yutaro Kiyomura, Tsuyoshi Takagi

Publication date 15 September 2014

Published in Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41383-4_13

zbMATH Keywords

Miller's algorithmNAF\(w\)-HBTFcomposite order pairing

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Faster computation of the Tate pairing
• Information Security and Privacy
• scientific article; zbMATH DE number 1950619
• Efficient Tate pairing computation using double-base chains
• Topics in Cryptology – CT-RSA 2005
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
• Efficient and Generalized Pairing Computation on Abelian Varieties
• scientific article; zbMATH DE number 2086895
• An optimal Tate pairing computation using Jacobi quartic elliptic curves

Cited in

(2)

• Fixed argument pairings
• Faster computation of the Tate pairing

This page was built for publication: Efficient Algorithm for Tate Pairing of Composite Order

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