A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
From MaRDI portal
Publication:3600512
DOI10.1007/978-3-540-85538-5_20zbMath1186.94424OpenAlexW194557307MaRDI QIDQ3600512
Francisco Rodríguez-Henríquez, Jérémie Detrey, Jean-Luc Beuchat, Eiji Okamoto, Nicolas Brisebarre
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
elliptic curveFPGAfinite field arithmetichardware acceleratormodified Tate pairingreduced \(\eta _{T }\) pairing
Related Items
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Koblitz curves over quadratic fields, Parallelizing the Weil and Tate Pairings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- Hardware architectures for the Tate pairing over GF\((2^{m})\)
- On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
- Hardware Acceleration of the Tate Pairing in Characteristic Three
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- The Eta Pairing Revisited
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
- Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
- Information Security and Privacy
- Cryptography and Coding
- Algorithmic Number Theory
- Advances in Cryptology - ASIACRYPT 2003
