An efficient and high-speed VLSI implementation of optimal normal basis multiplication over GF(2 )

Author:

Rashidi Bahram,Sayedi Sayed Masoud,Farashahi Reza Rezaeian

Funder

IPM

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Hardware and Architecture,Software

Reference37 articles.

1. Algorithm engineering for public key algorithms;Beth;IEEE J. Sel. Areas Comm.,1989

2. Sequential type-1 optimal normal basis multiplier and multiplicative inverse in GF(2m);Chiou;Tamkang J. Sci. Eng.,2010

3. VLSI architectures for computing multiplications and inverses in GF(2m);Wang;IEEE Trans. Comput.,1985

4. L. Gao, G.E. Sobelman, Improved VLSI designs for multiplication and inversion in GF(2m) over normal bases, in: Proceedings of 13th Annual IEEE International ASIC/SOC Conference, 2000, pp. 97–101.

5. A. Reyhani-Masoleh, M.A. Hasan, Low complexity sequential normal basis multipliers over GF(2m), in: Proceedings of the 16th IEEE Symposium on Computer Arithmetic, vol. 16, 2003, pp. 188–195.

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. PriorMSM: An Efficient Acceleration Architecture for Multi-Scalar Multiplication;ACM Transactions on Design Automation of Electronic Systems;2024-08-13

2. HRM: M-Term Heterogeneous Hybrid Blend Recursive Multiplier for GF(2 n ) Polynomial;IEEE Transactions on Very Large Scale Integration (VLSI) Systems;2024-08

3. High-performance unified modular multiplication algorithm and hardware architecture over G(2m);Integration;2024-05

4. Hardware Architectures of Multipliers in Binary Galois Fields with Characteristic Less Than 1024;Springer Proceedings in Physics;2022

5. Design of an S-ECIES Cryptoprocessor Using Gaussian Normal Bases Over GF(2 m );IEEE Transactions on Very Large Scale Integration (VLSI) Systems;2021-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3