Efficient multiplication over extension fields

DOI10.1007/978-3-642-31662-3_10MaRDI QIDQ3166977zbMATH OpenOpenAlexFDO

Authors Nadia El Mrabet, Nicolas Gama

Publication date 1 November 2012

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31662-3_10

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Recommendations

• Efficient multiplication in finite field extensions of degree 5
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
• On multiplication in finite fields
• scientific article; zbMATH DE number 1583947
• Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography

Cited in

(7)

• Efficient arithmetic in successive algebraic extension fields using symmetries
• Efficient multiplication in finite field extensions of degree 5
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)

This page was built for publication: Efficient multiplication over extension fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166977)