全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2002 

GF(2n)域上的一种Ⅱ型优化正规基乘法器及其FPGA实现

, PP. 2045-2048

Keywords: 有限域,正规基,乘法

Full-Text   Cite this paper   Add to My Lib

Abstract:

有限域GF(2n)上的椭圆曲线密码体制以其密钥短,安全强度高的优点正在获得广泛的重视和应用.该密码体制最主要的运算是有限域上的乘法运算.本文提出了一种基于Ⅱ型优化正规基的乘法器,该乘法器具有Massey-Omura乘法器的优点,又避免了其不足,易于编程,适合FPGA实现.实验表明,该算法简单,快速.

References

[1]  R M Wilson.Optimal normal bases in GF(pn)[J].Discrete Applied Mathematics,1988/89,22:149-161.
[2]  ANSI X.962,Public Key Cryptography for the Financial Services Industry-the Elliptic Curve Digital Signature Algorithm (ECDSA)[S].1999.
[3]  ANSI X.962,Public Key Cryptography for the Financial Services Industry-Elliptic Curve Key Agreement and Transposition Standards[S].2000.
[4]  J Omura,J Massey.Computational Method and Apparatus for FiniteField Arithmetic[P].U S Patent Number 4,587,627,May 1986.
[5]  C K Koc,B Sunar.Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields[J].IEEE Transactions on Computers,1998,3,47(3):353-356.
[6]  M A Hasan,M Z Wang,V K Bhargava.A modified Massey-Omura parallel multiplier for a class of finite fields[J].IEEE Transactions on Computers,1993,11,42(10):1278-1280.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133