Efficient Bit-Parallel Multiplier for All Trinomials Based on <italic>n</italic>-Term Karatsuba Algorithm

Efficient Bit-Parallel Multiplier for All Trinomials Based on <italic>n</italic>-Term Karatsuba Algorithm

Recently, hybrid multiplication schemes over the binary extension field <inline-formula> <tex-math notation="LaTeX">$GF(2^{m})$ </tex-math></inline-formula> based on <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-f...

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:
Hybrid bit-parallel multiplier
trinomial
Karatsuba algorithm
Mastrovito approach
shifted polynomial basis
Online Access:https://ieeexplore.ieee.org/document/9195527/

Internet

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

Similar Items