Algebraic relation of three MinRank algebraic modelings
From MaRDI portal
Publication:6169016
DOI10.1007/978-3-031-22944-2_15OpenAlexW4315489988MaRDI QIDQ6169016
No author found.
Publication date: 10 August 2023
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22944-2_15
Vector spaces, linear dependence, rank, lineability (15A03) Canonical forms, reductions, classification (15A21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the generalized MinRank problem
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The computational complexity of some problems of linear algebra
- Improved cryptanalysis of UOV and Rainbow
- Efficient key recovery for all HFE signature variants
- On the complexity of ``Superdetermined minrank instances
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Extension Field Cancellation: A New Central Trapdoor for Multivariate Quadratic Systems
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- On the Complexity of the Rank Syndrome Decoding Problem
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Cryptanalysis of MinRank
- Multivariates Polynomials for Hashing
- Unbalanced Oil and Vinegar Signature Schemes
- Information and Communications Security
This page was built for publication: Algebraic relation of three MinRank algebraic modelings