Fault analysis-resistant implementation of Rainbow Signature Scheme

被引:0
作者
Nakkar, Mouna [1 ]
Mahmoud, Moustafa [1 ]
Youssef, Amr [1 ]
机构
[1] Concordia Univ, Concordia Inst Informat Syst Engn, Montreal, PQ, Canada
来源
2017 29TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS (ICM) | 2017年
关键词
HARDWARE; CRYPTOSYSTEMS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multivariate Public Key Cryptosystems (MPKC) are cryptographic schemes based on the difficulty of solving a set of multivariate system of nonlinear equations over a finite field. MPKC are considered to be secure against quantum attacks. Rainbow, an MPKC signature scheme, is among the leading MPKC candidates for post quantum cryptography. In this paper, we propose and compare two fault analysis-resistant implementations for the Rainbow signature scheme. The hardware platform for our implementations is Xilinx FPGA Virtex 7 family. Our implementation for the Rainbow signature completes in 191 cycles using a 20ns clock period which is an improvement over the previously reported implementations. The verification completes in 141 cycles using the same clock period. The two proposed fault analysis-resistant schemes offer different levels of protections and increase the area overhead by a factor of 33% and 9%, respectively. The first protection scheme acquires a time overhead of about 72%, but the second one does not have any time overhead.
引用
收藏
页码:95 / 99
页数:5
相关论文
共 16 条
  • [1] Fast Multivariate Signature Generation in Hardware: The Case of Rainbow
    Balasubramanian, Sundar
    Bogdanov, Andrey
    Rupp, Andy
    Ding, Jintai
    Carter, Harold W.
    [J]. PROCEEDINGS OF THE SIXTEENTH IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, 2008, : 281 - +
  • [2] Bogdanov A, 2006, ANN IEEE SYM FIELD P, P237
  • [3] Boneh D., 1997, Advances in Cryptology - EUROCRYPT '97. International Conference on the Theory and Application of Cryptographic Techniques Proceedings, P37
  • [4] Elliptic curve cryptosystems in the presence of permanent and transient faults
    Ciet, M
    Joye, M
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2005, 36 (01) : 33 - 43
  • [5] Ding JT, 2005, LECT NOTES COMPUT SC, V3531, P164
  • [6] A new efficient algorithm for computing Grobner bases (F4)
    Faugére, JC
    [J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 1999, 139 (1-3) : 61 - 88
  • [7] General Fault Attacks on Multivariate Public Key Cryptosystems
    Hashimoto, Yasufumi
    Takagi, Tsuyoshi
    Sakurai, Kouichi
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (01) : 196 - 205
  • [8] Hoffstein J., 1998, Algorithmic Number Theory. Third International Symposium, ANTS-III. Proceedings, P267, DOI 10.1007/BFb0054868
  • [9] Kamal Abdel Alim, 2009, 2009 21st International Conference on Microelectronics (ICM 2009), P209, DOI 10.1109/ICM.2009.5418649
  • [10] Strengthening hardware implementations of NTRUEncrypt against fault analysis attacks
    Kamal, Abdel Alim
    Youssef, Amr M.
    [J]. JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (04) : 227 - 240