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

椭圆曲线密码算法的边信道攻击研究
引用本文:刘双根,胡予濮,徐文胜.椭圆曲线密码算法的边信道攻击研究[J].武汉理工大学学报(交通科学与工程版),2007,31(3):491-493,505.
作者姓名:刘双根  胡予濮  徐文胜
作者单位:1. 西安电子科技大学计算机网络与信息安全教育部重点实验室,西安,710071;江西师范大学计算机信息工程学院南昌,330022
2. 西安电子科技大学计算机网络与信息安全教育部重点实验室,西安,710071
3. 江西师范大学计算机信息工程学院南昌,330022
摘    要:边信道攻击是一种对密码算法实现的有效的攻击.针对椭圆曲线密码的实现,简单边信道攻击可以逐步确定私钥.文中讨论了通过模糊私钥的标量表示和椭圆曲线计算序列的关系来抵抗简单边信道攻击.为了分析这些算法,文中提出了一种新的方法,即把椭圆曲线标量乘运算看作马尔可夫链.理论证明,这种方法比标准的简单边信道攻击更有效.

关 键 词:简单边信道攻击  椭圆曲线密码  马尔可夫链
修稿时间:2007-02-14

Study of Side-Channel Attacks for Elliptic Curve Cryptosystem Algorithm
Liu Shuanggen,Hu Yupu,Xu Wensheng.Study of Side-Channel Attacks for Elliptic Curve Cryptosystem Algorithm[J].journal of wuhan university of technology(transportation science&engineering),2007,31(3):491-493,505.
Authors:Liu Shuanggen  Hu Yupu  Xu Wensheng
Abstract:ide-channel attacks are serious practical threat against implementation of cryptographic algorithms.Regarding implementation of elliptic curve cryptosystems, simple side-channel attacks(SSCA) can be used to determine the private key gradually.This paper discusses a certain class of countermeasures which try to achieve a protection against SSCA by obscuring the relationship between the digits in the digit representation of the secrete key and the sequence of elliptic curve operation.To analyze those algorithms,a new method which models point multiplication algorithms as Markov Chain is proposed in this paper.Theoretical proof shows that this method is more efficient than the normal side channel attacks.
Keywords:simple side channel attacks  elliptic curve cryptosystems  markov chain
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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