Fast Multivariate Signature Generation in Hardware: The Case of Rainbow

Sundar Balasubramanian, Andrey Bogdanov, Andy Rupp, Jintai Ding, Harold W. Carter

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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 languageEnglish
Title of host publicationProceedings of 16th International Symposium on Field-Programmable Custom Computing Machines, 2008. FCCM 08
PublisherIEEE
Publication date2008
Pages281-282
ISBN (Print)978-0-7695-3307-0
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event16th International Symposium on Field-Programmable Custom Computing Machines 2008 (FCCM) - Palo Alto, CA, United States
Duration: 14 Apr 200815 Apr 2008
Conference number: 16

Conference

Conference16th International Symposium on Field-Programmable Custom Computing Machines 2008 (FCCM)
Number16
CountryUnited States
CityPalo Alto, CA
Period14/04/200815/04/2008

Fingerprint Dive into the research topics of 'Fast Multivariate Signature Generation in Hardware: The Case of Rainbow'. Together they form a unique fingerprint.

Cite this