.png){kind=icon}
返回
Low complexity word-level sequential normal basis multipliers
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2005.29.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For efficient hardware implementation of finite field arithmetic units, the use of a normal basis is advantageous. In this paper, two classes of architectures for multipliers over the finite field GF(2(m)) are proposed. These multipliers are of sequential type, i.e., after receiving the coordinates of the two input field elements, they go through k, 1 less than or equal to k less than or equal to m, iterations (i.e., clock cycles) to finally yield all the coordinates of the product in parallel. The value of k depends on the word size omega = inverted right perpendicular m/k inverted left perpendicular. For omega > 1, these multipliers are highly area efficient and require fewer number of logic gates even when compared with the most area efficient multipliers available in the open literature. This makes the proposed multipliers suitable for applications where the value of m is large but space is of concern, e. g., resource constrained cryptographic systems. Additionally, if the field dimension m is composite, i.e., m = kn, then the extension of one class of the architectures yields a highly efficient multiplier over composite fields.
Keyword:
finite field
Massey-Omura multiplier
optimal normal basis
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
Elevated serum transaminase levels resulting from concomitant use of rosuvastatin and amiodarone
OAAI
.png){kind=icon}
OAAI分享收藏
分享收藏
查看更多内容