Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition

DOI10.1007/978-3-540-85538-5_19zbMath1186.94453OpenAlexW1650411492MaRDI QIDQ3600511

Tsuyoshi Takagi, Kazumaro Aoki, Yuto Kawahara

Publication date: 10 February 2009

Published in: Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_19

zbMATH Keywords

\(\eta _{T }\) pairingGF\((3)\)-additionlogical instruction

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of MNT curves and supersingular curves
• Efficient pairing computation on supersingular abelian varieties
• Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
• Identity-Based Encryption from the Weil Pairing
• Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
• Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
• Advances in Cryptology - EUROCRYPT 2004
• Software Implementation of Arithmetic in
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Cryptography and Coding
• Algorithmic Number Theory
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition