Multivariate signatures with polynomial factorization

DOI10.1007/978-3-032-22695-2_12MaRDI QIDQ7319489zbMATH OpenFDO

Authors Irene Di Muzio, Martin Feussner, Igor Semaev

Publication date 25 August 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22695-2_12

Mathematics Subject Classification ID

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

Cites work

• A New Algorithm for Factoring Polynomials Over Finite Fields
• Breaking rainbow takes a weekend on a laptop
• Cryptanalysis of MinRank
• Distribution of Bordered Persymmetric Matrices in a Finite Field.
• Efficient key recovery for all HFE signature variants
• Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• scientific article; zbMATH DE number 3775748 (Why is no real title available?)
• scientific article; zbMATH DE number 1418284 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• On the complexity of solving generic overdetermined bilinear systems
• On the existence of homogeneous semi-regular sequences in \(\mathbb{F}_2[X_1,\ldots,X_n]/(X_1^2,\ldots,X_n^2)\)
• Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
• Semi-regularity of pairs of Boolean polynomials
• Simple matrix scheme for encryption
• Solving quadratic equations with XL on parallel architectures
• The computational complexity of some problems of linear algebra (extended abstract)

This page was built for publication: Multivariate signatures with polynomial factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319489)