Fast multivariate signature generation in hardware: The case of rainbow

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

*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

20 Citations (Scopus)

Abstract

This paper presents a time-area 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 are presented. The resulting signature generation core of Rainbow requires 63,593 gate equivalents and signs a message in just 804 clock cycles at 67 MHz using AMI 0.35μm CMOS technology. Thus, Rainbow provides significant performance improvements compared to RSA and ECDSA.

Original languageEnglish
Title of host publicationASAP08, Conference Proceedings - IEEE 19th International Conference on Application-Specific Systems, Architectures and Processors
Pages25-30
Number of pages6
DOIs
Publication statusPublished - 2008
Externally publishedYes
EventASAP08 - IEEE 19th International Conference on Application-Specific Systems, Architectures and Processors - Leuven, Belgium
Duration: 2 Jul 20084 Jul 2008

Publication series

NameProceedings of the International Conference on Application-Specific Systems, Architectures and Processors
ISSN (Print)1063-6862

Conference

ConferenceASAP08 - IEEE 19th International Conference on Application-Specific Systems, Architectures and Processors
Country/TerritoryBelgium
CityLeuven
Period2/07/084/07/08

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