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_19zbMATH Open1186.94453OpenAlexW1650411492MaRDI QIDQ3600511FDOQ3600511

Authors: Yuto Kawahara, Kazumaro Aoki, Tsuyoshi Takagi 

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

Recommendations

• An optimal multiplication algorithm for the \(\eta_T\) pairing over \(F_{3^{6m}}\)
• FPGA and ASIC implementations of the \(\eta _T\) pairing in characteristic three
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
• Efficient bit-parallel multipliers over finite fields GF\((2^m)\)
• A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
• Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
• Hardware architectures for the Tate pairing over GF\((2^{m})\)
• Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

Cited In (3)

• Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing
• An optimal multiplication algorithm for the \(\eta_T\) pairing over \(F_{3^{6m}}\)
• An efficient residue group multiplication for the \(\eta _{T }\) pairing over \({\mathbb F}_{3^m}\)

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

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