Abstract
Multivariate Cryptography is one of the main candidates for securing communication in a post-quantum world. One of the most promising schemes from this area is the Rainbow signature scheme. While this scheme provides very fast signature generation and verification, the key generation process of Rainbow is relatively slow. In this paper, we propose an algorithm which speeds up the key generation process of the standard Rainbow signature scheme by up to two orders of magnitude, such eliminating one of the few drawbacks of this scheme. Furthermore, we present an improved key generation algorithm for the CyclicRainbow signature scheme. This algorithm allows to generate a key pair for Cyclic Rainbow in essentially the same time as a key pair for standard Rainbow, thus making CyclicRainbow a practical alternative to the standard scheme. Our algorithms are implemented in the Rainbow proposal for the second round of the NIST standardization process for post-quantum cryptosystems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
It may happen, that one of the linear systems does not have a solution. If so, one has to choose other values for the Vinegar variables \(x_1, \dots x_{v_1}\) and try again.
References
Bernstein, D., Buchmann, J., Dahmen, E.: Post Quantum Cryptography. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-88702-7
Beullens, W., Preneel, B.: Field lifting for smaller UOV public keys. In: Patra, A., Smart, N.P. (eds.) INDOCRYPT 2017. LNCS, vol. 10698, pp. 227–246. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-71667-1_12
Casanova, A., Faugère, J., Macario-Rat, G., Patarin, J., Perret, L., Ryckeghem, J.: GeMSS: a great multivariate short signature, January 2019. https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Round-2-Submissions
Ding, J., Cheng, M.S., Petzoldt, A., Schmidt, D., Yang, B.Y.: Rainbow: algorithm specification and documentation, December 2017. https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Round-1-Submissions
Ding, J., Cheng, M.S., Petzoldt, A., Schmidt, D., Yang, B.Y.: Rainbow: algorithm specification and documentation, January 2019. https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Round-2-Submissions
Ding, J., Schmidt, D.: Rainbow, a new multivariable polynomial signature scheme. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 164–175. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_12
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206–222. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48910-X_15
Kipnis, A., Shamir, A.: Cryptanalysis of the oil and vinegar signature scheme. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 257–266. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0055733
National Institute for Standards and Technology: Post-Quantum Cryptography Standardization, December 2016. https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Post-Quantum-Cryptography-Standardization
National Institute of Standards and Technology: Digital Signature Standard (DSS). FIPS 186–4 (2013)
Patarin, J.: The oil and vinegar signature scheme, presented at the Dagstuhl Workshop on Cryptography, September 1997
Petzoldt, A.: Selecting and reducing key sizes for multivariate cryptography. PhD thesis. TU Darmstadt, July 2013. http://tuprints.ulb.tu-darmstadt.de/3523/
Petzoldt, A., Bulygin, S., Buchmann, J.: CyclicRainbow – a multivariate signature scheme with a partially cyclic public key. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 33–48. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17401-8_4
Petzoldt, A., Bulygin, S., Buchmann, J.: Fast verification for improved versions of the UOV and rainbow signature schemes. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 188–202. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38616-9_13
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)
Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)
Wolf, C., Preneel, B.: Equivalent keys in HFE, C*, and variations. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 33–49. Springer, Heidelberg (2005). https://doi.org/10.1007/11554868_4
Acknowledgments
We want to thank Ming-Shing Chen and Bo-Yin Yang for implementing of our algorithms.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Petzoldt, A. (2020). Efficient Key Generation for Rainbow. In: Ding, J., Tillich, JP. (eds) Post-Quantum Cryptography. PQCrypto 2020. Lecture Notes in Computer Science(), vol 12100. Springer, Cham. https://doi.org/10.1007/978-3-030-44223-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-44223-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44222-4
Online ISBN: 978-3-030-44223-1
eBook Packages: Computer ScienceComputer Science (R0)