第8讲 椭圆曲线密码体制.pptVIP

密 码 学韦宝典 副教授 中山大学电子系 weibd@ 第8讲：公钥密码体制（2） 椭圆曲线密码体制 椭圆曲线密码体制(Elliptic Curve Cryptography) ，即ECC 1985年，华盛顿大学的Neal Koblitz和 相互独立地提出的 当时在IBM工作的Victor Miller 被数学家在代数学和代数几何学领域研究了150多年的 椭圆曲线在密码领域中得以发挥重要作用。 由于ECC具有的特性，利用ECC 不但可以实现高度安全性， 且在同等安全强度下，可以用较小的开销和时延实现较高的安全性。 所需的计算量、存储量、带宽、软件和硬件实现的规模等、加密和签字速度高 ECC已经成为公钥密码的主流， 成为设计大多数计算能力和集成电路空间受限(如Smart卡)、 带宽受限又要求高速实现的安全产品 的首选。 Elliptic curve group over real number y2 = x3 + ax + b, where x, y, a and b are real numbers. All (x,y) points satisfying above equation along with infinite point O and addition operation, form a group Suppose P=(x,y) then define –P=(x,-y) Elliptic curve example Elliptic curve group over complex number C Elliptic curve example If P and Q are distinct, and P ? -Q, define P+Q as follows: Draw a line through P and Q, then the line will intersect with the curve, the intersected point is denoted as –R, and define P+Q=R. If P =Q, define P+Q as follows: draw a tangent line through P, the intersected point is defined as –R, then P+P =2P =R. If P=(x,0), then P+P = O , (in fact, a vertical line) Define P + (-P) = O Addition operation (A Geometric Approach) Definition of P+Q = R Definition of P+(-P) Definition of P+P (where y!=0) Definition of P+P (where y=0) Addition operation (An Algebraic Approach ) Elliptic Curve Groups over Zp Elliptic Curve Groups over Zp y2 = x3 + x mod 23 Points on Elliptic curve along with addition operation form a group. Given a point P (P ? (x, 0)), consider 2P=P+P, 3P=2P+P, …., nP=(n-1)P+P,… Given any n, it is easy to compute R=nP, however given R, it is very difficult to find n, such that nP=R. Elliptic Curve Discrete Logarithm Problem (ECDLP). Here the addition is same as the multiplication in Zp. ECC就是建立在求解ECDLP困难基础上的。 Elliptic Curve groups and the Discrete Logarithm