Fast Multivariate Signature Generation in Hardware: The Case of Rainbow

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

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • FCCM '08 Proceedings of the 2008 16th International Symposium on Field-Programmable Custom Computing Machines
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with the design of an area-timeefficient hardware architecture for the multivariate signaturescheme, Rainbow. As a part of this architecture, a highperformancehardware optimized variant of the well-knownGaussian elimination over GF(2l) and its efficient implementationis presented. Besides solving LSEs, the architecture is alsore-used for the linear transformation operations of the scheme,thereby saving on area. The resulting signature generationcore of Rainbow requires 63,593 gate equivalents and signsa message in just 804 clock cycles. A comparison of ourarchitecture with implementations of the RSA, the ECDSA andthe en-TTS scheme shows that Rainbow in hardware providessignificant performance improvements.