Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
From MaRDI portal
Publication:3522142
Recommendations
- Hardware implementation of pairings
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
- scientific article; zbMATH DE number 1979307
- Hardware architectures for the Tate pairing over GF\((2^{m})\)
Cited in
(15)- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- scientific article; zbMATH DE number 1979307 (Why is no real title available?)
- Hardware implementation of pairings
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
- Complexity of computation in finite fields
- Formulas for cube roots in \(\mathbb F_{3^m}\)
- A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
- On Software Parallel Implementation of Cryptographic Pairings
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
- Hardware architectures for the Tate pairing over GF\((2^{m})\)
- Hardware Acceleration of the Tate Pairing in Characteristic Three
This page was built for publication: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522142)
