Hardware Acceleration of the Tate Pairing in Characteristic Three

DOI10.1007/11545262_29zbMath1319.94065OpenAlexW1548839370MaRDI QIDQ3522139

Philipp Grabher, Dan Page

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_29

zbMATH Keywords

elliptic curveFPGApairingidentity based encryption

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (6)

On the distribution of irreducible trinomials over \(\mathbb F_3\) ⋮ A class of Gaussian normal bases and their dual bases ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) ⋮ A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials ⋮ 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

This page was built for publication: Hardware Acceleration of the Tate Pairing in Characteristic Three