Side channel analysis method and device for rainbow signature

Abstract

The invention discloses a side channel analysis method for rainbow signature. The method includes the following steps that: S1, N message-signature pairs, and N power consumption curves which are in one-to-one correspondence with the N message-signature pairs are generated, wherein N is a positive integer greater than 2000; S2, calculation formulas in the rainbow signature algorithm are obtained,and elements in GF(2k) are sequentially selected as the guess values of the keys in the calculation formulas, and the input values of the calculation formulas are acquired according to messages in each of the message-signature pairs, and operation is performed, output values are obtained; and S3, the N power consumption curves are analyzed based on N input values and N output values correspondingto each guess value, the keys in the calculation formulas are obtained. Correspondingly, the present invention also discloses a side channel analysis device for rainbow signature. With the method andthe device provided by the embodiment of the present invention adopted, the security problem of the rainbow signature can be found, and therefore, technical support can be provided for defense side channel attacks.

Description

technical field [0001] The invention relates to the technical field of information security, in particular to a side channel analysis method and device of a rainbow signature. Background technique [0002] Rainbow (Rainbow) signature is a kind of multi-variable public key cryptography, which has the ability to resist quantum computer attacks. Its security is based on an NP-Hard problem, that is, solving multivariate and multivariate equations in finite fields, most of which are quadratic polynomials. [0003] Rainbow's multivariate signature structure Contains two affine transformations and a central mapping transformation: y 0 ,y 1 ,...,y m-1 is the message, x 0 ,x 1 ,...,x n-1 is the signature, F is the central mapping transformation, L 1 , L 2 is an affine transformation, the key consists of F, L 1 , L 2 composition. first affine transformation A is an m×m matrix, b is a vector of length m, and a and b are keys. The second affine transformation C is an n...

AI Technical Summary

Problems solved by technology

However, in the existing technology, there are few side-channel security analyzes of Rainbow signatures, and the security problems of Rainbow signatures cannot be found, so the security of Rainbow signatures cannot be guaranteed, which hinders the wide application of Rainbow signatures to a certain extent.

Images