Solving Degree and Degree of Regularity for Polynomial Systems over a Finite Fields

DOI10.1007/978-3-642-42001-6_4zbMath1291.94074OpenAlexW70420423MaRDI QIDQ2867246

Dieter S. Schmidt, Jintai Ding

Publication date: 10 December 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42001-6_4

zbMATH Keywords

degree of regularityrandom polynomial systemHFEsolving degreenon-degenerate systemHFEv

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (9)

Solving degree, last fall degree, and related invariants ⋮ New complexity estimation on the rainbow-band-separation attack ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ On the complexity of solving generic overdetermined bilinear systems ⋮ The complexity of solving Weil restriction systems ⋮ On the termination of the general XL algorithm and ordinary multinomials ⋮ Solving multivariate polynomial systems and an invariant from commutative algebra ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family

This page was built for publication: Solving Degree and Degree of Regularity for Polynomial Systems over a Finite Fields