Extension Field Cancellation: A New Central Trapdoor for Multivariate Quadratic Systems
暂无分享,去创建一个
[1] J. Faugère. A new efficient algorithm for computing Gröbner bases (F4) , 1999 .
[2] Yannick Seurin,et al. Analysis of Intermediate Field Systems , 2009, IACR Cryptol. ePrint Arch..
[3] Chen-Mou Cheng,et al. Breaking the Symmetry: a Way to Resist the New Differential Attack , 2007, IACR Cryptol. ePrint Arch..
[4] Luk Bettale,et al. Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic , 2012, Designs, Codes and Cryptography.
[5] Joseph H. Silverman,et al. NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.
[6] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.
[7] Philippe Gaborit,et al. Post-quantum cryptography : 5th International Workshop, PQCrypto 2013 Limoges, France, June 4-7, 2013 : proceedings , 2013 .
[8] Bart Preneel,et al. Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations , 2005, IACR Cryptol. ePrint Arch..
[9] Jintai Ding,et al. ZHFE, a New Multivariate Public Key Encryption Scheme , 2014, PQCrypto.
[10] Enrico Thomae,et al. About the security of multivariate quadratic public key schemes , 2013 .
[11] Jacques Patarin,et al. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.
[12] Daniel Smith-Tone. Properties of the Discrete Differential with Cryptographic Applications , 2010, PQCrypto.
[13] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .
[14] Jacques Patarin,et al. Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 , 1995, CRYPTO.
[15] Nicolas Courtois,et al. The Security of Hidden Field Equations (HFE) , 2001, CT-RSA.
[16] Jintai Ding,et al. Degree of regularity for HFE- , 2011, IACR Cryptol. ePrint Arch..
[17] Adi Shamir,et al. Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization , 1999, CRYPTO.
[18] Jean Charles Faugère,et al. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.
[19] Adi Shamir,et al. Efficient Signature Schemes Based on Birational Permutations , 1993, CRYPTO.
[20] Jacques Stern,et al. Practical Cryptanalysis of SFLASH , 2007, CRYPTO.
[21] Hideki Imai,et al. Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption , 1988, EUROCRYPT.
[22] Jintai Ding,et al. Inverting HFE Systems Is Quasi-Polynomial for All Fields , 2011, CRYPTO.
[23] Jintai Ding,et al. Rainbow, a New Multivariable Polynomial Signature Scheme , 2005, ACNS.
[24] Christopher Wolf,et al. Cryptanalysis of Enhanced TTS, STS and All Its Variants, or: Why Cross-Terms Are Important , 2012, AFRICACRYPT.
[25] Jacques Stern,et al. Cryptanalysis of SFLASH with Slightly Modified Parameters , 2007, EUROCRYPT.
[26] Bo-Yin Yang,et al. Degree of Regularity for HFEv and HFEv- , 2013, PQCrypto.
[27] Antoine Joux,et al. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases , 2003, CRYPTO.
[28] Bart Preneel,et al. On the security of stepwise triangular systems , 2006, Des. Codes Cryptogr..
[29] Louis Goubin,et al. Unbalanced Oil and Vinegar Signature Schemes , 1999, EUROCRYPT.
[30] Jintai Ding,et al. Simple Matrix Scheme for Encryption , 2013, PQCrypto.
[31] Louis Goubin,et al. C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai , 1998, ASIACRYPT.