Fast Multivariate Signature Generation in Hardware: The Case of Rainbow

被引：11

作者：

Balasubramanian, Sundar ^{[1
]}

Bogdanov, Andrey ^{[2
]}

Rupp, Andy ^{[2
]}

Ding, Jintai ^{[3
]}

Carter, Harold W. ^{[1
]}

机构：

[1] Univ Cincinnati, Dept Elect & Comp Engn, Cincinnati, OH 45221 USA

[2] Ruhr Univ Bochum, Horst Gortz Inst IT Secur, Bochum, Germany

[3] Univ Cincinnati, Dept Math Sci, Cincinnati, OH USA

来源：

PROCEEDINGS OF THE SIXTEENTH IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES | 2008年

关键词：

D O I：

10.1109/FCCM.2008.52

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper deals with the design of an area-time efficient hardware architecture for the multivariate signature scheme, Rainbow. As a part of this architecture, a high-performance hardware optimized variant of the well-known Gaussian elimination over GF(2(l)) and its efficient implementation is presented. Besides solving LSEs, the architecture Is also re-used for the linear transformation operations of the scheme, thereby saving on area. The resulting signature generation core of Rainbow requires 63,593 gate equivalents and signs a message in just 804 clock cycles. A comparison of our architecture with implementations of the RSA, the ECDSA and the en-TTS scheme shows that Rainbow In hardware provides significant performance improvements.

引用

页码：281 / +

页数：2

共 10 条

[1]

Aigner H, 2004, LECT NOTES COMPUT SC, V3156, P107

[2]

Akkar ML, 2003, LECT NOTES COMPUT SC, V2567, P267

[3]

BODGANOV A, 2006, FCCM, P237

[4]

Ding JT, 2005, LECT NOTES COMPUT SC, V3531, P164

[5]

Grossschadl J., 2000, Cryptographic Hardware and Embedded Systems - CHES 2000. Second International Workshop. Proceedings (Lecture Notes in Computer Science Vol.1965), P191

[6]

Kipnis A, 1999, LECT NOTES COMPUT SC, V1592, P206

[7]

Schroeppel R, 2002, LECT NOTES COMPUT SC, V2523, P366

[8]

Wang LC, 2005, LECT NOTES COMPUT SC, V3386, P244

[9]

Yang BY, 2006, LECT NOTES COMPUT SC, V3934, P73

[10]

Yang Bo-Yin, 2004, RANK ATTACKS DEFENCE

← 1 →