基于椭圆曲线离散对数问题的公钥密码  

Public-Key Cryptography Based on Elliptic Curve Discrete Logarithm Problem

作　　者：李学俊[1] 敬忠良[1] 戴冠中[1] 张骏[2] 

机构地区：[1]西北工业大学自动控制系,西安710072 [2]上海交通大学航空航天信息与控制研究所电子信息学院,上海200030

出　　处：《计算机工程与应用》2002年第6期20-22,共3页Computer Engineering and Applications

基　　金：国家教育部留学回国人员基金资助;跨世纪优秀人才培养计划基金资助

摘　　要：自1985年Koblitz和Miller首次提出椭圆曲线密码之后,这种公钥密码的潜力越来越被人们所认识。首先对椭圆曲线及其相关知识做了简单介绍,而后以相当篇幅从三个方面介绍当前椭圆曲线密码的研究热点,最后给出典型椭圆曲线密码。作为一篇综述,文中反映了椭圆曲线密码的发展状况以及当前所面临的问题,体现了该领域目前的最新成就。Since the introduction of Elliptic Curves cryptography by Koblitz and Miller in1985,the potential for the use of this public-key cryptosystems has been recognized.In this paper,the concepts of elliptic curves and their related knowledge are introduced briefly,and three aspects consideration of elliptic curves cryptography are given a properly detailed description,and a few typical schemes are given.As a summary,the advance and the status of the elliptic curve cryptography are reflected,and so do the problems the cryptography face now.The newest achievements in this area are covered.

关 键 词：公钥密码 椭圆曲线离散对数问题 安全性 数点问题 标量乘法 保密通信 

分 类 号：TN918.1[电子电信—通信与信息系统]