Conference paper
Fast Multivariate Signature Generation in Hardware: The Case of Rainbow
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.
| Language: | English |
|---|---|
| Year: | 2008 |
| Pages: | 281-282 |
| Proceedings: | 2008 16th International Symposium on Field-Programmable Custom Computing Machines (FCCM) |
| ISBN: | 0769533078 , 150908150X , 150908150x , 9780769533070 and 9781509081509 |
| Types: | Conference paper |
| DOI: | 10.1109/FCCM.2008.52 |
Clocks Computer architecture Elliptic curve cryptography Equations Galois fields Gaussian elimination Gaussian processes Hardware Polynomials Public key Public key cryptography Rainbow Security digital signatures fast multivariate signature generation linear transformations multivariate multivariate public-key cryptosystems public key cryptography rainbow signature scheme special-purpose hardware
