On the complexity of ``Superdetermined'' minrank instances (Q2302132)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of ``Superdetermined'' minrank instances
scientific article

    Statements

    On the complexity of ``Superdetermined'' minrank instances (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 February 2020
    0 references
    Minrank problem
    0 references
    multivariate
    0 references
    cryptanalysis
    0 references
    HFE
    0 references

    Identifiers