Space Efficient <inline-formula> <tex-math notation="LaTeX">$GF(2^m)$ </tex-math></inline-formula> Multiplier for Special Pentanomials Based on <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>-Term Karatsuba Algorithm

Space Efficient <inline-formula> <tex-math notation="LaTeX">$GF(2^m)$ </tex-math></inline-formula> Multiplier for Special Pentanomials Based on <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>-Term Karatsuba Algorithm

Recently, new multiplication schemes over the binary extension field GF(2<sup>m</sup>) based on an n-term Karatsuba algorithm have been proposed for irreducible trinomials. In this paper, we extend these schemes for trinomials to any irreducible polynomials. We introduce some new types o...

Full description

Bibliographic Details
Main Authors: Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Bit-parallel multiplier
Karatsuba algorithm
Mastrovito approach
pentanomial
shifted polynomial basis
Online Access:https://ieeexplore.ieee.org/document/8984363/

Internet

https://ieeexplore.ieee.org/document/8984363/

Similar Items