Fast multivariate signature generation in hardware: The case of rainbow

  • Authors:
  • Sundar Balasubramanian;Harold W. Carter;Andrey Bogdanov;Andy Rupp; Jintai Ding

  • Affiliations:
  • Department of ECE, University of Cincinnati, OH, USA;Department of ECE, University of Cincinnati, OH, USA;Horst-Görtz Institute for IT-Security, Ruhr-University Bochum, Germany;Horst-Görtz Institute for IT-Security, Ruhr-University Bochum, Germany;Department of Mathematical Sciences, University of Cincinnati, OH, USA

  • Venue:
  • ASAP '08 Proceedings of the 2008 International Conference on Application-Specific Systems, Architectures and Processors
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.