基于椭圆曲线的签密方案  

SIGNCRYPTION SCHEME BASED ON ELLIPTIC CURVES

作　　者：崔文军 贾志娟 胡明生 公备[2] 王利朋 Cui Wenjun;Jia Zhijuan;Hu Mingsheng;Gong Bei;Wang Lipeng(College of Information Science and Technology,Zhengzhou Normal University,Zhengzhou 450044,Henan,China;College of Computer Science,Beijing University of Technology,Beijing 100124,China)

机构地区：[1]郑州师范学院信息科学与技术学院,河南郑州450044 [2]北京工业大学计算机学院,北京100124

出　　处：《计算机应用与软件》2020年第3期304-309,共6页Computer Applications and Software

基　　金：国家自然科学基金项目(U1304614,U1204703);河南省科技攻关项目(162102310238);河南省教育科学“十三五”规划一般课题((2018)-JKGHYB-0279);郑州市创新型科技人才队伍建设工程基金项目(131PCXTD597)。

摘　　要：签密方案既能够满足数字签名又可以满足公钥加密,且成本远低于“先签名后加密”。针对求解椭圆曲线离散对数问题的困难性,提出基于椭圆曲线的签密方案,并证明了其前向安全性和可公开验证性。相比现有的方案,该方案主要用到了模乘运算,且模指数与模逆运算均为0次。与文献[8]方案相比较,该方案模乘运算少了一次,签密长度少|n|,计算量明显较少,在理论上达到了复杂度的最小值。Signcryption can satisfy both the functions of the digital signature and public key encryption,and its cost is much lower than“signature followed by encryption”.To solve the elliptic curve(ECC)discrete logarithm problem,this paper proposes a signcryption scheme based on ECC,and its forward security and public verifiability are proved.Compared with the existing schemes,the proposed scheme mainly used the model multiplication,and both the numbers of model index and model inverse were reached zero time.Compared with literature[8],our scheme has less modular multiplication once,less signcryption length|n|,less computation,and the minimum complexity in theory.

关 键 词：签密 离散对数问题 前向安全 公开验证 模乘 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]