检索结果-南通市图书馆

Low-complexity multiplexer-based normal basis multiplier over GF（2^m）

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2009年第6期10卷 834-842页

作者： Jenn-Shyong HORNG I-Chang JOU Chiou-Yng LEE Institute of Engineering Science and Technology National Kaohsiung First University of Science and Technology Department of Computer Information and Network Engineering Lunghwa University of Science and Technology

We present a new normal basis multiplication scheme using a multiplexer-based algorithm. In this algorithm, the proposed multiplier processes in parallel and has a multiplexer-based structure that uses MUX and XOR gates instead of AND and XOR gates. We show that our multiplier for type-1 and type-2 normal bases saves about 8% and 16%, respectively, in space complexity as compared to existing normal basis multipliers. Finally, the proposed architecture has regular and modular con-figurations and is well suited to VLSI implementations.

关键词： finite field multiplication Normal basis Gaussian normal basis Elliptic curve cryptosystem

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Low latency systolic multipliers for finite field GF（2m） based on irreducible polynomials

引用

Journal of Central South University 2012年第5期19卷 1283-1289页

作者：谢佳峰贺建军桂卫华 School of Information Science and Engineering Central South University

Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity,but its latency is usually very ***,two low latency systolic multipliers over GF(2m) based on general irreducible polynomials and irreducible pentanomials are ***,a signal flow graph(SFG) is used to represent the algorithm for multiplication over GF(2m).Then,the two low latency systolic structures for multiplications over GF(2m) based on general irreducible polynomials and pentanomials are presented from the SFG by suitable cut-set retiming,*** indicates that the proposed two low latency designs involve at least one-third less area-delay product when compared with the existing designs,To the authors' knowledge,the time-complexity of the structures is the lowest found in literature for systolic GF(2m) multipliers based on general irreducible polynomials and *** proposed low latency designs are regular and modular,and therefore they are suitable for many time critical applications.

关键词： finite field finite field multiplication systolic structure low latency polynomials

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：