Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18

DOI10.1007/978-3-540-68164-9_27zbMath1142.11380OpenAlexW133725558MaRDI QIDQ3506396

Murat Cenk, Ferruh Özbudak

Publication date: 13 June 2008

Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68164-9_27

zbMATH Keywords

pairing based cryptographyfinite field multiplicationChinese Remainder Theorem

Mathematics Subject Classification ID

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

Related Items (3)

Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\) ⋮ On multiplication in finite fields ⋮ Multiplication of polynomials modulo \(x^n\)

Cites Work

• Unnamed Item
• Five, six, and seven-term Karatsuba-like formulae
• Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
• Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
• A new structured design method for convolutions over finite fields, Part I
• Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$

This page was built for publication: Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18