Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
暂无分享,去创建一个
Adi Shamir | Jacques Patarin | Nicolas Courtois | Alexander Klimov | N. Courtois | A. Shamir | Jacques Patarin | A. Klimov
[1] Rudolf Lide,et al. Finite fields , 1983 .
[2] Iyad A. Ajwa,et al. Grobner Bases Algorithm , 1995 .
[3] Jacques Patarin,et al. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.
[4] Don Coppersmith,et al. Finding a Small Root of a Univariate Modular Equation , 1996, EUROCRYPT.
[5] H. Niederreiter,et al. Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .
[6] Neal Koblitz,et al. Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.
[7] Neal Koblitz. Hidden Monomial Cryptosystems , 1998 .
[8] Adi Shamir,et al. Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization , 1999, CRYPTO.
[9] Louis Goubin,et al. Unbalanced Oil and Vinegar Signature Schemes , 1999, EUROCRYPT.
[10] J. Faugère. A new efficient algorithm for computing Gröbner bases (F4) , 1999 .
[11] A. Shamir,et al. Cryptanalysis of the HFE Public Key Cryptosystem , 1999 .
[12] Nicolas Courtois,et al. The Security of Hidden Field Equations (HFE) , 2001, CT-RSA.