Abstract
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(2l) 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.
Original language | English |
---|---|
Title of host publication | Proceedings of 16th International Symposium on Field-Programmable Custom Computing Machines, 2008. FCCM 08 |
Publisher | IEEE |
Publication date | 2008 |
Pages | 281-282 |
ISBN (Print) | 978-0-7695-3307-0 |
DOIs | |
Publication status | Published - 2008 |
Externally published | Yes |
Event | 16th International Symposium on Field-Programmable Custom Computing Machines 2008 (FCCM) - Palo Alto, CA, United States Duration: 14 Apr 2008 → 15 Apr 2008 Conference number: 16 |
Conference
Conference | 16th International Symposium on Field-Programmable Custom Computing Machines 2008 (FCCM) |
---|---|
Number | 16 |
Country/Territory | United States |
City | Palo Alto, CA |
Period | 14/04/2008 → 15/04/2008 |