A Comparison between Hardware Accelerators for the Modified Tate Pairing over \mathbb{F}_{2ᵐ} and \mathbb{F}_{3ᵐ}
DOI10.1007/978-3-540-85538-5_20zbMATH Open1186.94424OpenAlexW194557307MaRDI QIDQ3600512FDOQ3600512
Authors: Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez 
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_20
Recommendations
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- Hardware implementation of pairings
- Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
- scientific article; zbMATH DE number 1979307
- FPGA and ASIC implementations of the \(\eta _T\) pairing in characteristic three
elliptic curveFPGAfinite field arithmetichardware acceleratormodified Tate pairingreduced \(\eta _{T }\) pairing
Cites Work
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- Title not available (Why is that?)
- The Eta Pairing Revisited
- Algorithmic Number Theory
- Reducing elliptic curve logarithms to logarithms in a finite field
- Title not available (Why is that?)
- Advances in Cryptology - ASIACRYPT 2003
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- Cryptography and Coding
- Title not available (Why is that?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Information Security and Privacy
- Hardware Acceleration of the Tate Pairing in Characteristic Three
- Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
- Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Hardware architectures for the Tate pairing over GF\((2^{m})\)
Cited In (7)
- Koblitz curves over quadratic fields
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Parallelizing the Weil and Tate pairings
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
This page was built for publication: A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600512)
