Mutant Gröbner Basis Algorithm
暂无分享,去创建一个
Stefan O. Tohaneanu | J. Buchmann | Jintai Ding | Daniel Cabarcas | Dieter Schmidt | Dieter S. Schmidt
[1] Bruno Buchberger,et al. A theoretical basis for the reduction of polynomials to canonical forms , 1976, SIGS.
[2] Heinz Kredel,et al. Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .
[3] Jacques Patarin,et al. Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 , 1995, CRYPTO.
[4] J. Faugère. A new efficient algorithm for computing Gröbner bases (F4) , 1999 .
[5] Jean Charles Faugère,et al. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.
[6] Josef Pieprzyk,et al. Cryptanalysis of Block Ciphers with Overdefined Systems of Equations , 2002, ASIACRYPT.
[7] Antoine Joux,et al. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases , 2003, CRYPTO.
[8] Feipei Lai,et al. A "Medium-Field" Multivariate Public-Key Encryption Scheme , 2006, CT-RSA.
[9] Lei Hu,et al. High Order Linearization Equation (HOLE) Attack on Multivariate Public Key Cryptosystems , 2007, Public Key Cryptography.