Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
From MaRDI portal
Publication:4975064
DOI10.1109/TC.2008.103zbMath1367.11087MaRDI QIDQ4975064
Tsuyoshi Takagi, Jean-Luc Beuchat, Jérémie Detrey, Nicolas Brisebarre, Eiji Okamoto, Masaaki Shirase
Publication date: 8 August 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Mathematical problems of computer architecture (68M07)
Related Items (5)
Cryptanalysis of Pairing-Based Cryptosystems Over Small Characteristic Fields ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis ⋮ 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}$
This page was built for publication: Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
