椭圆曲线数字签名算法下的公钥密钥验证

摘要

Elliptic Curve Digital Signature Algorithm (ECDSA) is the use of elliptic curve digital signature algorithm (DSA) of the simulation. And the ordinary discrete logarithm problem (DLP) and the integer faetorization problem (IFP) is different from the elliptic curve discrete logarithm problem (ECDLP) no sub-exponential time solution. Therefore, ECC strength per bit than other public key system. This paper introduces the elliptic encryption and authentication password system and basic knowledge of the foundation, in a reference to the prime field elliptic curve, public key identity authentication system further study, analysis of how to generate key pairs, and through public key algorithm to verify whether meet the requirements and the importance of CA.%椭圆曲线数字签名算法(ECDSA)是使用椭圆曲线对数字签名算法(DSA)的模拟.与普通的离散对数问题(Discrete logarithm problem DLP)和大数分解问题(Integer factorization problem IFP)不同,椭圆曲线离散对数问题(Ellipticcurve discrete logarithm problem ECDLP)没有亚指数时间的解决方法.因此椭圆曲线密码的单位比特强度要高于其他公钥体制.论文中介绍了椭圆密码体制及加密认证的基础知识,在素数域上引用一条椭圆曲线,建立身份认证体系进一步对公钥认证进行研究,分析如何产生密钥对,并通过算法来验证公钥是否满足要求以及CA的重要性.