.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Binary polynomial multiplication
two-way
three-way
four-way split formulas
subquadratic space complexity
binary field
block recombination
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏A new approach to subquadratic space complexity parallel multipliers for extended binary fields
PREAI
分享收藏
查看更多内容