摘要
边信道攻击是一种对密码算法实现的有效的攻击.针对椭圆曲线密码的实现,简单边信道攻击可以逐步确定私钥.文中讨论了通过模糊私钥的标量表示和椭圆曲线计算序列的关系来抵抗简单边信道攻击.为了分析这些算法,文中提出了一种新的方法,即把椭圆曲线标量乘运算看作马尔可夫链.理论证明,这种方法比标准的简单边信道攻击更有效.
Side-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.
出处
《武汉理工大学学报(交通科学与工程版)》
2007年第3期491-493,505,共4页
Journal of Wuhan University of Technology(Transportation Science & Engineering)
基金
国家自然科学基金项目资助(批准号:60473029)
关键词
简单边信道攻击
椭圆曲线密码
马尔可夫链
simple side channel attacks
elliptic curve cryptosystems
markov chain