Fast multivariate signature generation in hardware: The case of rainbow

Sundar Balasubramanian Department of Electrical and Computer Engineering, University of Cincinnati, OH Andrey Bogdanov Horst-Gortz Institute for IT-Security, Ruhr-University Bochum, Germany Andy Rupp Horst-Gortz Institute for IT-Security, Ruhr-University Bochum, Germany Jintai Ding Department of Mathematical Sciences, University of Cincinnati, OH Harold W Carter Department of Electrical and Computer Engineering, University of Cincinnati, OH

TBD mathscidoc:2207.43038

ASAP 2008, 25-30, 2008.7
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(2^l) 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.
No keywords uploaded!
[ Download ] [ 2022-07-12 10:16:16 uploaded by dingjt ] [ 538 downloads ] [ 0 comments ]
@inproceedings{sundar2008fast,
  title={Fast multivariate signature generation in hardware: The case of rainbow},
  author={Sundar Balasubramanian, Andrey Bogdanov, Andy Rupp, Jintai Ding, and Harold W Carter},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220712101616397285615},
  booktitle={ASAP 2008},
  pages={25-30},
  year={2008},
}
Sundar Balasubramanian, Andrey Bogdanov, Andy Rupp, Jintai Ding, and Harold W Carter. Fast multivariate signature generation in hardware: The case of rainbow. 2008. In ASAP 2008. pp.25-30. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220712101616397285615.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved