.png){kind=icon}
返回
A fast algorithm for multiplicative inversion in GF(2m) using normal basis
.png){kind=icon}
PRE
AI
DOI：10.1109/12.926155.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A fast algorithm for multiplicative inversion in GF(2(m)) using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat's Theorem and require O(log m) multiplications. The number of multiplications is reduced by decomposing m - 1 into several factors and a small remainder.
Keyword:
finite field
finite field inversion
Fermat's theorem
normal basis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏