.png){kind=icon}
返回
Efficient multiplication beyond optimal normal bases
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2003.1190584.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In cryptographic applications, the use of normal bases to represent elements of the finite field GF(2(m)) is quite advantageous, especially for hardware implementation. In this article, we consider an important field operation, namely, multiplication which is used in many cryptographic functions. We present a class of algorithms for normal basis multiplication in GF(2(m)). Our proposed multiplication algorithm for composite finite fields requires a significantly lower number of bit level operations and, hence, can reduce the space complexity of cryptographic systems.
Keyword:
finite fields
multiplication
normal bases
composite fields
optimal bases
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
PREAI
分享收藏分享收藏
查看更多内容