.png){kind=icon}
返回
Fast normal basis multiplication using general purpose processors
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2003.1244936.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms for normal basis multiplication over the extended binary field GF(2(m)). We present a vector-level algorithm which essentially eliminates the bit-wise inner products needed in the conventional approach to the normal basis multiplication. We then present another algorithm which significantly reduces the dynamic instruction counts. Both algorithms utilize the full width of the data-path of the general purpose processor on which the software is to be executed. We also consider composite fields and present an algorithm which can provide further speed-ups and an added flexibility toward hardware-software codesign of processors for very large finite fields.
Keyword:
finite field multiplication
normal basis
software algorithms
ECDSA
composite fields
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
暂无机构信息
引用论文
Elevated serum transaminase levels resulting from concomitant use of rosuvastatin and amiodarone
OAAI
.png){kind=icon}
OAAI分享收藏
分享收藏
查看更多内容