A Secure Variant of the SRP Encryption Scheme with Shorter Private Key

The study of multivariate encryption algorithm is an important topic of multivariate public key cryptography research. However, quite few secure and practical multivariate encryption algorithms have been found up to now. The SRP encryption scheme is a multivariate encryption scheme that combines Square, Rainbow and the Plus method technique, which is of high efficiency and resistant to existing known attacks against multivariate schemes. In this paper, an improved SRP scheme with shorter private key and higher decryption efficiency is proposed. We introduce rotation relations into parts of the private key, which enables us to reduce the private key size by about 61%. And the decryption speed is 2.1 times faster than that of the original SRP. In terms of theory and experiment, we analyze the security of the improved SRP for several attacks against SRP. The results show that our modifications do not weaken the security of the original schemes.

[1]  Jintai Ding,et al.  ZHFE, a New Multivariate Public Key Encryption Scheme , 2014, PQCrypto.

[2]  Jintai Ding,et al.  Inoculating Multivariate Schemes Against Differential Attacks , 2006, Public Key Cryptography.

[3]  Louis Goubin,et al.  Unbalanced Oil and Vinegar Signature Schemes , 1999, EUROCRYPT.

[4]  Kouichi Sakurai,et al.  A Multivariate Encryption Scheme with Rainbow , 2015, ICICS.

[5]  Olivier Billet,et al.  Cryptanalysis of Rainbow , 2006, SCN.

[6]  J. Faugère.  A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[7]  Tsuyoshi Takagi,et al.  Reducing the Key Size of the SRP Encryption Scheme , 2016, ACISP.

[8]  Daniel Smith-Tone.  On the Differential Security of Multivariate Public Key Cryptosystems , 2011, PQCrypto.

[9]  Shaohua Tang,et al.  RGB, a Mixed Multivariate Signature Scheme , 2016, Comput. J..

[10]  Bart Preneel,et al.  On the security of stepwise triangular systems , 2006, Des. Codes Cryptogr..

[11]  Jacques Stern,et al.  Differential Cryptanalysis for Multivariate Schemes , 2005, EUROCRYPT.

[12]  Shalhav Zohar,et al.  Toeplitz Matrix Inversion: The Algorithm of W. F. Trench , 1969, JACM.

[13]  Ludovic Perret,et al.  Cryptanalysis of MinRank , 2008, CRYPTO.

[14]  Bo-Yin Yang,et al.  Design Principles for HFEv- Based Multivariate Signature Schemes , 2015, ASIACRYPT.

[15]  Christopher Wolf,et al.  Roots of Square: Cryptanalysis of Double-Layer Square and Square+ , 2011, PQCrypto.

[16]  Jean-Charles Faugère,et al.  A survey on signature-based algorithms for computing Gröbner bases , 2017, J. Symb. Comput..

[17]  Bo-Yin Yang,et al.  Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS , 2005, ACISP.

[18]  Hideki Imai,et al.  Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption , 1988, EUROCRYPT.

[19]  Michael K. Ng,et al.  On inversion of Toeplitz matrices , 2002 .

[20]  Stephen Barnett,et al.  Inversion of certain extensions of Toeplitz matrices , 1984 .

[21]  Jintai Ding,et al.  Rainbow, a New Multivariable Polynomial Signature Scheme , 2005, ACNS.

[22]  Jean-Charles Faugère,et al.  On the complexity of the generalized MinRank problem , 2011, J. Symb. Comput..

[23]  Jean Charles Faugère,et al.  A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.

[24]  Jacques Patarin,et al.  Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[25]  Jintai Ding,et al.  Simple Matrix Scheme for Encryption , 2013, PQCrypto.

[26]  Jacques Patarin,et al.  Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 , 1995, CRYPTO.

[27]  Louis Goubin,et al.  QUARTZ, 128-Bit Long Digital Signatures , 2001, CT-RSA.