Abstract
An efficient hardware implementation of Rainbow signature scheme is presented in this paper. It introduces an effective way to accelerate the generation of multivariate signatures by using optimized arithmetics including multiplication, multiplicative inverse and Gaussian elimination over finite fields. Not only the speed but also the area are considered in the design. 27 parallel multipliers are adopted and the design has been fully implemented on a low-cost Field Programmable Gate Array. Compared with other public key implementations, the proposed implementation with 15490 gate equivalents and 2570 clock cycles has better performance. The cycle-area product of this implementation shows that it is suitable for fast multivariate signature generation in the resource-limited environments, e.g.smart cards.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ding, J., Schmidt, D.: Multivariate public key cryptosystems. In: Advances in Information Security. Citeseer (2006)
Yang, B.Y., Cheng, C.M., Chen, B.R., Chen, J.M.: Implementing minimized multivariate PKC on low-resource embedded systems. Security in Pervasive Computing, pp. 73–88 (2006)
Yang, B.Y., Chen, J.M., Chen, Y.H.: TTS: High-speed signatures on a low-cost smart card. Cryptographic Hardware and Embedded Systems, 318–348 (2004)
Chen, A., Chen, C.H., Chen, M.S., Cheng, C.M., Yang, B.Y.: Practical-sized instances of multivariate PKCs. Post-Quantum Cryptography, 95–108 (2008)
Balasubramanian, S., Carter, H.W., Bogdanov, A., Rupp, A., Ding, J.: Fast multivariate signature generation in hardware: The case of Rainbow. In: International Conference on Application-Specific Systems, Architectures and Processors, pp. 25–30. IEEE, Los Alamitos (2008)
Wang, C.C., Troung, T.K., Shao, H.M., Deutsch, L.J., Omura, J.K., Reed, I.S.: VLSI architectures for computing multiplications and inverses in GF(2m). IEEE Transactions on Computers, 709–717 (1985)
Schroeder, M.R., Schroeder, M.R.: Number theory in science and communication. Springer, Heidelberg (1986)
Großschädl, J.: High-Speed RSA Hardware Based on Barret’s Modular Reduction Method. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 95–136. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yi, H., Tang, S., Chen, H., Chen, G. (2011). Fast Implementation of Rainbow Signatures via Efficient Arithmetic over a Finite Field. In: Zhu, M. (eds) Electrical Engineering and Control. Lecture Notes in Electrical Engineering, vol 98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21765-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-21765-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21764-7
Online ISBN: 978-3-642-21765-4
eBook Packages: EngineeringEngineering (R0)