Description and generation of the key pair in the ES Rainbow algorithm

Fìz.-mat. model. ìnf. tehnol. 2021, 32:111-115

Abstract

This paper describes the representation and generation of a key pair for one of the promising candidates at the NIST USA level in the NIST PQC competition for the direction of digital signatures of the Rainbow algorithm. This algorithm is a candidate for the third round of selection and a possible option for Ukraine to build its own DS standards based on the mathematics of multivariable quadratic schemes (MQ transformations), which is used in this algorithm. Within the competition, the developers give several sets of parameters for different security levels and several possible implementations of the algorithm (classical, CZ, compressed), but the given description and performance measurements, for the described algorithm, concern the classical Rainbow scheme (although the declared performance improvement is also fair in relation to other versions).

References

1. Ding, J., Schmidt, D. (2005). Rainbow, a new multivariable polynomial signature scheme. Springer. ACNS 2005, LNCS, 3531, 164-175.
2. Kipnis, A., Patarin, J., Goubin, L. (1999). Unbalanced Oil and Vinegar schemes. Springer. EUROCRYPT, LNCS, 1592, 206-222.
   DOI doi.org/10.1007/3-540-48910-x_15Review
3. Petzoldt, A., Bulygin, S., Buchmann, J. (2010). Selecting Parameters for the Rainbow Signature Scheme. Extended Version. PQCrypto`10.
4. Ding J. (2020). Rainbow Signature. [Electronic resource]. – Access mode: https://www.pqcrainbow.org/.