首页>
外国专利>
System for elliptic curve encryption using multiple points on an elliptic curve derived from scalar multiplication
System for elliptic curve encryption using multiple points on an elliptic curve derived from scalar multiplication
展开▼
机译:使用从标量乘法得出的椭圆曲线上的多个点进行椭圆曲线加密的系统
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method of elliptic curve encryption includes, (a) selecting an elliptic curve Ep (a,b) of the form y2=x3+ax+b mod (p) wherein a and b are non-negative integers less than p satisfying the formula 4 a3+27b2 mod (p) not equal to 0; (b) generating a large 160 bit random number by a method of concatenation of a number of smaller random numbers; (c) generating a well hidden point G (x,y) on the elliptic curve Ep (a,b) by scalar multiplication of a point B (x,y) on the elliptic curve with a large random integer which further includes the steps: (i) converting the large random integer into a series of powers of 231; (ii) converting each coefficient of 231 obtained from above step into a binary series; (iii) multiplication of binary series obtained from steps (i) and (ii) above with the point B (x,y) on the elliptic curve; (d) generating a private key nA (of about =160 bit length); (e) generating a public key PA (x,y) given by the formula PA (x,y)=(nA−G (x,y)) mod (p); (f) encrypting the input message MSG; (g) decrypting the ciphered text.
展开▼
机译:椭圆曲线加密的方法包括:(a)选择形式为y 2 Sup> = x 3 Sup的椭圆曲线E p Sub>(a,b) > + ax + b mod(p),其中a和b是小于p的非负整数,满足公式4 a 3 Sup> +27 b I> 2 Sup> mod(p)不等于0; (b)通过级联多个较小的随机数的方法来产生较大的160位随机数; (c)通过将椭圆曲线上的点B(x,y)与a进行标量乘法,在椭圆曲线E p Sub>(a,b)上生成隐井点G(x,y)大随机整数,进一步包括以下步骤:(i)将大随机整数转换为2 31 Sup>的幂次; (ii)将上述步骤中获得的每个2 31 Sup>系数转换为二进制序列; (iii)从上述步骤(i)和(ii)获得的二元序列乘以椭圆曲线上的点B(x,y); (d)生成私钥n A Sub>(大约> = 160位长度); (e)生成由公式P A Sub>(x,y)=(n A Sub> -G(x,y))mod(p); (f)加密输入消息MSG; (g)解密密文。
展开▼