期刊文献+

Miller算法的故障攻击研究 被引量:1

Fault Attack Against Miller's Algorithm
在线阅读 下载PDF
导出
摘要 椭圆曲线双线对以其高效的计算,广泛地应用于智能卡等资源受限的硬件设备中。Mill-er算法是双线性对计算的重要步骤。文章给出了针对Miller算法的故障攻击方案,通过干扰密码设备中算法的正确执行,利用得到的错误输出来建立方程组。该方案改进了Mrabet的攻击结果,降低了有限域上非线性方程组的复杂程度,最后通过实验证明了攻击方案的可行性。 Bilinear pairings on elliptic curve have been implemented efficiently, pairing based crypt- osystems are usually embedded in resource constrained devices like smart cards. Miller's algorithm is the critical step for bilinear pairing calculation. This paper presents a fault attack scheme against Miller' s algorithm. By disrupting the normal execution of an algorithm, the faulty outputs of crypto- graphic devices are used to construct the system of equations which improves the attack result of Mrabet, and reduces the complexity of nonlinear systems in the finite field. Finally, the scheme is demonstrated feasible through experiments.
出处 《信息工程大学学报》 2013年第1期7-12,共6页 Journal of Information Engineering University
基金 国家863计划资助项目(2009AA01Z417)
关键词 Miller算法 故障攻击 双线性对 MAGMA GROBNER基 Miller' s algorithm fault attack pairing Magma Groebner base
  • 相关文献

参考文献14

  • 1Kocher P. Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems[C]//CRYPTO 1996. 1996: L04-113.
  • 2Boneh D, Demillo R, Lipton J. On the Importance of checking cryptographic protocols for faults [C]//EUROCRYPT 1997. 1997 : 37-51.
  • 3Boneh D, Franklin M. Identity-based encryption from the Weil pairing[ C ]//Advances in Cryptology proceedings of CRYPTO 2001. 2001 : 213-229.
  • 4Barreto P, Kim H, Lynn B, Scott M. Efficient algorithms for pairing-based cryptosystems[C]//Advances in Cryptology proceedings of CRYPTO 2002. 2002 : 354-368.
  • 5Duursma I M, Lee H S. Tate pairing implementation for hyperelliptic curves y2 = xe _ x + d[ C ]//Asiacrypt 2003. 2003 : 111-123.
  • 6Grabher P. Hardware acceleration of the Tate pairing in characteristic three [ C ]//Cryptographic Hardware and Embedded Systems 2005. 2005: 398-411.
  • 7Scott M, Costigan N, Abdulwahab W. Implementing cryptographic pairings on smartcards[ C ]//Cryptographic Hardware and Embedded Systems 2006. 2006: 134-147.
  • 8Page D, Vercauteren F. A Fault attack on pairing based cryptography[J]. IEEE Transaction on Computers, 2006, 55 (9) : 1075-1050.
  • 9Barreto P, Galbraith S, O'hEigeartaigh C, Scott M. Efficient pairing computation on supersingular abelian varieties[J]. Designs, Codes and Cryptography, 2007, 42 (3) : 239-271.
  • 10Whelan C, Scott M. The Importance of the Final Exponentiation in Pairings When Considering Fault Attack [C]//Pairing 2007. 2007 : 225-246.

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部