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_20MaRDI QIDQ3600512zbMATHOpenAlexFDO

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

zbMATH Keywords

elliptic curveFPGAfinite field arithmetichardware acceleratormodified Tate pairingreduced \(\eta _{T }\) pairing

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 2086895 (Why is no real title available?)
• 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
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Advances in Cryptology - ASIACRYPT 2003
• Algorithmic Number Theory
• Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
• Cryptography and Coding
• Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
• Efficient pairing computation on supersingular abelian varieties
• Hardware Acceleration of the Tate Pairing in Characteristic Three
• Hardware architectures for the Tate pairing over GF\((2^{m})\)
• Information Security and Privacy
• Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
• On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Eta Pairing Revisited
• The Weil pairing, and its efficient calculation

Cited in

(7)

• 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
• Koblitz curves over quadratic fields
• 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
• Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

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)