Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
From MaRDI portal
Publication:3522142
DOI10.1007/11545262_30zbMath1319.94070OpenAlexW1541610148MaRDI QIDQ3522142
Emanuel M. Popovici, William Marnane, Tim Kerins, Paulo S. L. M. Barreto
Publication date: 29 August 2008
Published in: Cryptographic Hardware and Embedded Systems – CHES 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11545262_30
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (10)
On the distribution of irreducible trinomials over \(\mathbb F_3\) ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) ⋮ A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials ⋮ Complexity of computation in finite fields ⋮ 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 ⋮ Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition ⋮ A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ ⋮ Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ ⋮ On Software Parallel Implementation of Cryptographic Pairings
This page was built for publication: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
