Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$

DOI10.1007/978-3-540-77360-3_12zbMath1154.11348OpenAlexW934125151MaRDI QIDQ5452256

Christoph Puttmann, Jamshid Shokrollahi, Elisa Gorla

Publication date: 25 March 2008

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77360-3_12

zbMATH Keywords

fast Fourier transformLagrange interpolationFinite field arithmeticTate pairing computation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18 ⋮ Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition ⋮ Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography

Cites Work

• Five, six, and seven-term Karatsuba-like formulae
• Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
• A new approach to error-correcting codes
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
• Selected Areas in Cryptography
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$