Refined F5 Algorithms for Ideals of Minors of Square Matrices

DOI10.1145/3597066.3597077arXiv2302.05375OpenAlexW4383221804WikidataQ131124619 ScholiaQ131124619MaRDI QIDQ6081937

Mohab Safey El Din, Unnamed Author, Vincent Neiger

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.05375

zbMATH Keywords

determinantal idealsGröbner basismultivariate cryptographypolynomial system solvingreal algebraic geometry

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the generalized MinRank problem
• Variant quantifier elimination
• Resolutions of determinantal ideals: The submaximal minors
• Syzygies des variétés déterminantales
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The computational complexity of some problems of linear algebra
• On the minors defined by a generic matrix
• On the complexity of solving quadratic Boolean systems
• Homotopy techniques for solving sparse column support determinantal polynomial systems
• An algebraic attack on rank metric code-based cryptosystems
• Solving determinantal systems using homotopy techniques
• Intrinsic complexity estimates in polynomial optimization
• On the geometry of polar varieties
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Generalized polar varieties: geometry and algorithms
• Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Variant real quantifier elimination
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• On the Complexity of Computing Critical Points with Gröbner Bases
• Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
• A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
• Ideals defined by matrices and a certain complex associated with them
• Rainbow, a New Multivariable Polynomial Signature Scheme
• Cryptanalysis of MinRank
• The Geometry of Syzygies
• Critical points and Gröbner bases
• Ideals, Varieties, and Algorithms
• Determinants, Gröbner Bases and Cohomology
• The first syzygies of determinantal ideals
• Breaking rainbow takes a weekend on a laptop
• Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow

This page was built for publication: Refined F5 Algorithms for Ideals of Minors of Square Matrices