Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
DOI10.1145/1837934.1837984zbMATH Open1321.68529OpenAlexW1986124084MaRDI QIDQ2946547FDOQ2946547
Authors: Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Mohab Safey El Din 
Publication date: 17 September 2015
Published in: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1837934.1837984
Recommendations
determinantal idealsmultivariate cryptographydegree of regularitypolynomial systems solvinggeneralized nonlinear eigenvalue problemmulti-homogeneous idealsGröbner bases
Eigenvalues, singular values, and eigenvectors (15A18) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rational invariants of a group action. Construction and rewriting
- Title not available (Why is that?)
- Differential invariants of a Lie group action: syzygies on a generating set
- Moving coframes. II: Regularization and theoretical foundations
- Title not available (Why is that?)
- Differential algebra for derivations with nontrivial commutation rules
- Generating differential invariants
- Smooth and algebraic invariants of a group action: Local and global constructions
- Invariants différentiels d'un pseudogroupe de Lie. II
- Differential invariants of conformal and projective surfaces
- Projective-type differential invariants and geometric curve evolutions of KdV-type in flat homogeneous manifolds
- Higher order contact of submanifolds of homogeneous spaces
- Invariants différentiels d'un pseudogroupe de Lie. I
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (30)
- A rank attack against extension field cancellation
- MinRank in the head. Short signatures from zero-knowledge proofs
- First fall degree and Weil descent
- Sparse FGLM algorithms
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Efficient key recovery for all HFE signature variants
- Solving rank-constrained semidefinite programs in exact arithmetic
- An algebraic attack on rank metric code-based cryptosystems
- (Short paper) Simple matrix signature scheme
- Solving multivariate polynomial systems and an invariant from commutative algebra
- Algebraic relation of three MinRank algebraic modelings
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- Rank analysis of cubic multivariate cryptosystems
- The complexity of MinRank
- Cryptanalysis of MinRank
- A polynomial time key-recovery attack on the Sidon cryptosystem
- MR-DSS -- smaller MinRank-based (ring-)signatures
- Refined F5 Algorithms for Ideals of Minors of Square Matrices
- Improvement of algebraic attacks for solving superdetermined MinRank instances
- Real root finding for determinants of linear matrices
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Improved cryptanalysis of UOV and Rainbow
- On the complexity of the generalized MinRank problem
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
- The product of matrix subspaces
- Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow
- Multivariate public key cryptosystem from Sidon spaces
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
Uses Software
This page was built for publication: Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946547)
