Building a new secure variant of Rainbow signature scheme

Building a new secure variant of Rainbow signature scheme

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Rainbow is an effective multivariate digital signature scheme proposed by Ding and Schmidt. However, a lot of attacks against it have been proposed. To resist all these attacks, designer should be very careful with its choice of parameters. In this study, the authors will propose a new approach to build a secure variant of Rainbow. According to our security analysis, it could resist all the existing attacks against Rainbow and save some memory in the meantime.


    1. 1)
      • 1. Shor, P.: ‘Algorithms for quantum computation: discrete logarithms and factoring’. 1994 Proc. 35th Annual Symp. Foundations of Computer Science, 1994, pp. 124134.
    2. 2)
    3. 3)
      • 3. Imai, H., Matsumoto, T.: ‘Algebraic methods for constructing asymmetric cryptosystems’. Algebraic Algorithms and Error-Correcting Codes, 1986, pp. 108119.
    4. 4)
      • 4. Matsumoto, T., Imai, H.: ‘Public quadratic polynomial-tuples for efficient signature-verification and message-encryption’. Advances in Cryptology-EUROCRYPT, 1988, pp. 419453.
    5. 5)
      • 5. Kipnis, A., Patarin, J., Goubin, L.: ‘Unbalanced Oil and Vinegar signature schemes’. Advances in Cryptology-EUROCRYPT99, 1999, pp. 206222.
    6. 6)
      • 6. Ding, J., Schmidt, D.: ‘Rainbow, a new multivariable polynomial signature scheme’, Appl. Cryptography Netw. Secur., 2005, pp. 317366.
    7. 7)
    8. 8)
    9. 9)
      • 9. Ding, J., Yang, B., Chen, C., et al: ‘New differential-algebraic attacks and reparametrization of Rainbow’. Proc. of the Sixth Int. Conf. on Applied Cryptography and Network Security, 2008, pp. 242257.
    10. 10)
      • 10. Kipnis, A., Shamir, A.: ‘Cryptanalysis of the Oil and Vinegar signature scheme’. Advances in Cryptology-CRYPTO98, 1998, pp. 257266.
    11. 11)
    12. 12)
      • 12. Faugere, J.: ‘A new efficient algorithm for computing Gröbner bases without reduction to zero F5’. Int. Symp. on Symbolic and Algebraic Computation Symp.-ISSAC, 2002.
    13. 13)
      • 13. Courtois, N., Klimov, A., Patarin, J., et al: ‘Efficient algorithms for solving overdefined systems of multivariate polynomial equations’. Advances in Cryptology-EUROCRYPT, 2000, pp. 392407.
    14. 14)
    15. 15)
      • 15. Petzoldt, A., Bulygin, S., Buchmann, J.: ‘Selecting parameters for the Rainbow signature scheme’, Post-Quantum Cryptography, pp. 218240.
    16. 16)
      • 16. Thomae, E.: ‘A generalization of the Rainbow band separation attack and its applications to multivariate schemes’. IACR Cryptology ePrint Archive, 2012, vol. 223.
    17. 17)

Related content

This is a required field
Please enter a valid email address