New Complexity Estimation on the Rainbow-Band-Separation Attack
Multivariate public key cryptography is a candidate for postquantum cryptography, and it allows generating particularly short signatures and fast verification. The Rainbow signature scheme proposed by J. Ding and D. Schmidt is such a multivariate cryptosystem and is considered secure against all known attacks. The Rainbow-Band-Separation attack recovers a secret key of Rainbow by solving certain systems of quadratic equations, and its complexity is estimated by the well-known indicator called the degree of regularity. However, the degree of regularity generally is larger than the solving degree in experiments, and an accurate estimation cannot be obtained. In this paper, we propose a new indicator for the complexity of the Rainbow-Band-Separation attack using the F4 algorithm, which gives a more precise estimation compared to one using the degree of regularity. This indicator is deduced by the two-variable power series ∏m i=1(1− t di1 1 t di2 2 ) (1− t1)1(1− t2)2 , which coincides with the one-variable power series at t1 = t2 deriving the degree of regularity. Moreover, we show a relation between the RainbowBand-Separation attack using the hybrid approach and the HighRank attack. By considering this relation and our indicator, we obtain a new complexity estimation for the Rainbow-Band-Separation attack. Consequently, we are able to understand the precise security of Rainbow against the Rainbow-Band-Separation attack using the F4 algorithm.