On the complexity of ``Superdetermined minrank instances

DOI10.1007/978-3-030-25510-7_10OpenAlexW2960677533MaRDI QIDQ2302132

Ray Perlner, John Baena, Daniel Cabarcas, Daniel Smith-Tone, Javier A. Verbel

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25510-7_10

zbMATH Keywords

cryptanalysismultivariateHFEMinrank problem

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (11)

A Rank Attack Against Extension Field Cancellation ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Improvement of algebraic attacks for solving superdetermined MinRank instances ⋮ MinRank in the head. Short signatures from zero-knowledge proofs ⋮ On the complexity of solving generic overdetermined bilinear systems ⋮ 2F -- a new method for constructing efficient multivariate encryption schemes ⋮ Algebraic relation of three MinRank algebraic modelings ⋮ Improvements of algebraic attacks for solving the rank decoding and MinRank problems ⋮ A multivariate cryptosystem inspired by random linear codes ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Multivariate public key cryptosystem from Sidon spaces

This page was built for publication: On the complexity of ``Superdetermined minrank instances