On the complexity of the generalized MinRank problem
Authors:
- Jean-Charles FaugèreJFJean-Charles Faugère
- Mohab Safey El DinMDMohab Safey El Din
- Pierre-Jean SpaenlehauerPSPierre-Jean Spaenlehauer
- 1 August 2013
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 55, 30-58
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristicDesigns, Codes and Cryptography, 2012
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree : Algorithms and complexityJournal of Symbolic Computation, 2011
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology2010
- On the geometry of polar varietiesApplicable Algebra in Engineering, Communication and Computing, 2010
- Polynomial evaluation and interpolation on special sets of pointsJournal of Complexity, 2005
- The Computational Complexity of Some Problems of Linear AlgebraJournal of Computer and System Sciences, 1999
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- On the Hilbert function of determinantal rings and their canonical moduleProceedings of the American Mathematical Society, 1994
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993