.png){kind=icon}
返回
Software multiplication using Gaussian normal bases
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2006.132.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields IF2m. In this paper, we present new software algorithms for efficient multiplication over IF2m that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multiplication and a method that exploits a mapping to a ring where fast polynomial-based techniques can be employed. Our analysis, including experimental results on an Intel Pentium family processor, shows that the new algorithms are faster and can use memory more efficiently than previous methods. Despite significant improvements, we conclude that the penalty in multiplication is still sufficiently large to discourage the use of normal bases in software implementations of elliptic curve systems.
Keyword:
multiplication in IF(2)m
Gaussian normal basis
elliptic curve cryptography
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
暂无机构信息
引用论文
Elevated serum transaminase levels resulting from concomitant use of rosuvastatin and amiodarone
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏
查看更多内容