首页 | 本学科首页   官方微博 | 高级检索  
     

Security Analysis of Discrete Logarithm Based Cryptosystems
引用本文:WANG Yuzhu LIAO Xiaofeng. Security Analysis of Discrete Logarithm Based Cryptosystems[J]. 武汉大学学报:自然科学英文版, 2006, 11(6): 1715-1717. DOI: 10.1007/BF02831858
作者姓名:WANG Yuzhu LIAO Xiaofeng
作者单位:School of Computer, Chongqing University, Chongqing 400030, China
摘    要:0 IntroductionNowthere are many well known cryptosystems based ondiscrete logarithms , such as the ElGamal cryptosys-tem[1]and the digital signature algorithm(DSA)[2]. Discretelogarithms have many advantages . Breaking the discrete log-arithm modulo pri mepappears to be somewhat harder thanfactoringintegern,and elliptic curve cryptosystems may usemuchsmaller keysizesthan RSA-basedcryptosystems of com-parable security.The discrete logarithmproblemover a group can be bro-ken down into a numb…

关 键 词:离散算法 安全分析 主要顺序小组 密码系统
文章编号:1007-1202(2006)06-1715-03
收稿时间:2006-05-16

Security analysis of discrete logarithm based cryptosystems
Wang Yuzhu,Liao Xiaofeng. Security analysis of discrete logarithm based cryptosystems[J]. Wuhan University Journal of Natural Sciences, 2006, 11(6): 1715-1717. DOI: 10.1007/BF02831858
Authors:Wang Yuzhu  Liao Xiaofeng
Affiliation:(1) School of Computer, Chongqing University, 400030 Chongqing, China
Abstract:Discrete logarithm based cryptosysterns have subtle problems that make the schemes vulnerable. This paper gives a comprehensive listing of security issues in the systems and analyzes three classes of attacks which are based on mathematical structure of the group which is used in the schemes, the disclosed information of the subgroup and implementation details respectively. The analysis will, in turn, allow us to motivate protocol design and implementation decisions.
Keywords:discrete logarithm  security analysis  prime order subgroup  secure implementation
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号