The finite field arithmetic, elliptic curve cryptography (ECC) and the finite field multiplier are investigated in this thesis.
本论文研究的主要内容是有限域算术、椭圆曲线加密算法和有限域乘法器。
Then, this paper introduces the math foundation required by ECC, including the addition rule for elliptic curve point defined over finite field.
其次介绍了ECC的数学基础，对有限域上椭圆曲线点的运算规则进行了详细描述。
Analysis of finite field modular multiplication requirement of Elliptic Curve Cryptography (ECC), the application specific instruction for modular multiplication computation is designed in this paper.
针对椭圆曲线密码算法中有限域模乘运算的需求，提出其专用模乘指令。
A fast arithmetic of ECC based over finite prime field is designed by the map of between affine coordinates and projective coordinates. This make it possible that ECC's...
利用仿射坐标与射影坐标的映射关系，设计了一种有限素整数域上ECC快速算法，使得ECC在电子商务中实际安全应用成为可能。
A fast arithmetic of ECC based over finite prime field is designed by the map of between affine coordinates and projective coordinates. This make it possible that ECC's...
利用仿射坐标与射影坐标的映射关系，设计了一种有限素整数域上ECC快速算法，使得ECC在电子商务中实际安全应用成为可能。
应用推荐