Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
From MaRDI portal
Publication:3519555
DOI10.1007/978-3-540-69499-1_9zbMath1246.12005OpenAlexW1490460472MaRDI QIDQ3519555
Arash Reyhani-Masoleh, Arash Hariri
Publication date: 19 August 2008
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_9
Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20) Mathematical problems of computer architecture (68M07)
Cites Work
- Unnamed Item
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- Systolic Multipliers for Finite Fields GF(2m)
- An efficient optimal normal basis type II multiplier
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Parallel multipliers based on special irreducible pentanomials
- A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
- New low-complexity bit-parallel finite field multipliers using weakly dual bases
- Bipartite Modular Multiplication Method
- Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>
This page was built for publication: Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
