.png){kind=icon}
返回
High-Speed Architectures for Multiplication Using Reordered Normal Basis
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2010.218.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Normal basis has been widely used for the representation of binary field elements mainly due to its low-cost squaring operation. Optimal normal basis type II is a special class of normal basis exhibiting very low multiplication complexity and is considered as a safe choice for hardware implementation of cryptographic applications. In this paper, high-speed architectures for binary field multiplication using reordered normal basis are proposed, where reordered normal basis is referred to as a certain permutation of optimal normal basis type II. Complexity comparison shows that the proposed architectures are faster compared to previously presented architectures in the open literature using either an optimal normal basis type II or a reordered normal basis. One advantage of the new word-level architectures is that the critical path delay is a constant (not a function of word size). This enables the multipliers to operate at very high clock rates regardless of the field size or the number of words. Hardware implementation of some practical size multipliers for elliptic curve cryptography is also included.
Keyword:
Finite field
binary field
optimal normal basis type II
reordered normal basis
multiplication algorithm
multiplier
hardware
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Preparation and characterization Co3O4 nanoparticles on porous silicon for humidity sensor by photoluminescence多孔硅上Co3O4纳米颗粒的制备和表征用于湿度传感器的光致发光.png)
Optik
OptikIF0
PREAI
分享收藏
Sensing Performance of Triple-Band Terahertz Metamaterial Absorber Based on Snowflake-Shaped ResonatorsPhotonics
OAAI
PhotonicsIF0
OAAI分享收藏Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
PREAI
分享收藏分享收藏分享收藏
查看更多内容