Fast multivariate signature generation in hardware: the case of rainbow

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

doi:10.1109/FCCM.2008.52

Fast multivariate signature generation in hardware: the case of rainbow

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

^*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

15 Citations (Scopus)

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 highperformance 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 language	English
Title of host publication	Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08
Pages	281-282
Number of pages	2
DOIs	https://doi.org/10.1109/FCCM.2008.52
Publication status	Published - 2008
Externally published	Yes
Event	16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08 - Stanford, CA, United States Duration: 14 Apr 2008 → 15 Apr 2008

Publication series

Name	Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08

Conference

Conference	16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08
Country/Territory	United States
City	Stanford, CA
Period	14/04/08 → 15/04/08

Access to Document

10.1109/FCCM.2008.52

Cite this

Balasubramanian, S., Bogdanov, A., Rupp, A., Ding, J., & Carter, H. W. (2008). Fast multivariate signature generation in hardware: the case of rainbow. In Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08 (pp. 281-282). Article 4724917 (Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08). https://doi.org/10.1109/FCCM.2008.52

@inproceedings{9b428a7ae4244df0b24752bff9ac507c,

title = "Fast multivariate signature generation in hardware: the case of rainbow",

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 highperformance 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.",

author = "Sundar Balasubramanian and Andrey Bogdanov and Andy Rupp and Jintai Ding and Carter, {Harold W.}",

year = "2008",

doi = "10.1109/FCCM.2008.52",

language = "English",

isbn = "9780769533070",

series = "Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08",

pages = "281--282",

booktitle = "Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08",

note = "16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08 ; Conference date: 14-04-2008 Through 15-04-2008",

}

Balasubramanian, S, Bogdanov, A, Rupp, A, Ding, J & Carter, HW 2008, Fast multivariate signature generation in hardware: the case of rainbow. in Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08., 4724917, Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08, pp. 281-282, 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08, Stanford, CA, United States, 14/04/08. https://doi.org/10.1109/FCCM.2008.52

Fast multivariate signature generation in hardware: the case of rainbow. / Balasubramanian, Sundar; Bogdanov, Andrey; Rupp, Andy et al.
Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08. 2008. p. 281-282 4724917 (Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

T1 - Fast multivariate signature generation in hardware

T2 - 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08

AU - Balasubramanian, Sundar

AU - Bogdanov, Andrey

AU - Rupp, Andy

AU - Ding, Jintai

AU - Carter, Harold W.

PY - 2008

Y1 - 2008

N2 - 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 highperformance 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.

AB - 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 highperformance 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.

UR - http://www.scopus.com/inward/record.url?scp=60349104283&partnerID=8YFLogxK

U2 - 10.1109/FCCM.2008.52

DO - 10.1109/FCCM.2008.52

M3 - Conference Proceeding

AN - SCOPUS:60349104283

SN - 9780769533070

T3 - Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08

SP - 281

EP - 282

BT - Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08

Y2 - 14 April 2008 through 15 April 2008

ER -

Balasubramanian S, Bogdanov A, Rupp A, Ding J, Carter HW. Fast multivariate signature generation in hardware: the case of rainbow. In Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08. 2008. p. 281-282. 4724917. (Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08). doi: 10.1109/FCCM.2008.52

Fast multivariate signature generation in hardware: the case of rainbow

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this