Efficient Key Generation for Rainbow
Petzoldt A (2020)
Publication Type: Conference contribution
Publication year: 2020
Journal
Publisher: Springer
Book Volume: 12100 LNCS
Pages Range: 92-107
Conference Proceedings Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Event location: Paris
ISBN: 9783030442224
DOI: 10.1007/978-3-030-44223-1_6
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.
Authors with CRIS profile
How to cite
APA:
Petzoldt, A. (2020). Efficient Key Generation for Rainbow. In Jintai Ding, Jean-Pierre Tillich (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 92-107). Paris, FR: Springer.
MLA:
Petzoldt, Albrecht. "Efficient Key Generation for Rainbow." Proceedings of the 11th International Conference on Post-Quantum Cryptography, PQCrypto 2020, Paris Ed. Jintai Ding, Jean-Pierre Tillich, Springer, 2020. 92-107.
BibTeX: Download