.png){kind=icon}
.png){kind=icon}
Return
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2013.105.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Some applications like cryptography involve a large number of multiplications of binary polynomial. In this paper, we consider two-, three-, and four-way methods for parallel implementation of binary polynomial multiplication. We propose optimized three-and four-way split formulas which reduce the space and time complexity of the best known methods. Moreover, we present a block recombination method which provides some further reduction in the space complexity of the considered two-, three-, and four-way split multipliers.
Keywords:
Binary polynomial multiplication
two-way
three-way
four-way split formulas
subquadratic space complexity
binary field
block recombination
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K