论文标题
密码学的可信赖的短Weierstrass椭圆形曲线的计算
Computation of Trusted Short Weierstrass Elliptic Curves for Cryptography
论文作者
论文摘要
短暂的Weierstrass的椭圆形曲线具有潜在的硬椭圆曲线离散对数问题，广泛用于加密应用中。本文为密码学的计算方法介绍了一种新的安全符号“可信度的安全性”。旨在密码学的椭圆曲线提出了另外三个“可信赖的安全验收标准”。此外，证明了两条密码在256位和384位质量领域的密码安全椭圆形曲线，这些曲线可从ECDLP，ECC以及信任的角度使用。拟议的椭圆曲线成功地进行了有关关键生成和签名/验证以及因此的彻底的安全分析和绩效评估，因此被证明是因为它们的加密性适用性以及社区接受的极大可行性。
Short Weierstrass's elliptic curves with underlying hard Elliptic Curve Discrete Logarithm Problems was widely used in Cryptographic applications. This paper introduces a new security notation 'trusted security' for computation methods of elliptic curves for cryptography. Three additional "trusted security acceptance criteria" is proposed to be met by the elliptic curves aimed for cryptography. Further, two cryptographically secure elliptic curves over 256 bit and 384 bit prime fields are demonstrated which are secure from ECDLP, ECC as well as trust perspectives. The proposed elliptic curves are successfully subjected to thorough security analysis and performance evaluation with respect to key generation and signing/verification and hence, proven for their cryptographic suitability and great feasibility for acceptance by the community.
