Efficient Multiplication in Finite Field Extensions of Degree 5

DOI10.1007/978-3-642-21969-6_12zbMath1280.12001OpenAlexW9592995MaRDI QIDQ3011913

Nadia El Mrabet, Sorina Ionica, Aurore Guillevic

Publication date: 29 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21969-6_12

zbMATH Keywords

interpolationimplementationfinite field arithmetic

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20)

Related Items (3)

Tower building technique on elliptic curve with embedding degree 18 ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Hardware implementation of multiplication over quartic extension fields

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A taxonomy of pairing-friendly elliptic curves
• Five, six, and seven-term Karatsuba-like formulae
• On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
• On Compressible Pairings and Their Computation
• Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
• Practical Cryptography in High Dimensional Tori
• Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
• Advances in Cryptology - CRYPTO 2003
• Cryptography and Coding
• Algorithmic Number Theory

This page was built for publication: Efficient Multiplication in Finite Field Extensions of Degree 5