MaxMinMax problem and sparse equations over finite fields

DOI10.1007/S10623-015-0058-6MaRDI QIDQ285259zbMATH OpenOpenAlexFDO

Authors Igor Semaev

Publication date 19 May 2016

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-015-0058-6

zbMATH Keywords

finite fields3-setsmaxminmax problemsparse equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Sparse algebraic equations over finite fields
• Beating brute force for systems of polynomial equations over finite fields
• On solving sparse algebraic equations over finite fields
• Improved agreeing-gluing algorithm
• A combinatorial problem related to sparse systems of equations

Cites work

• scientific article; zbMATH DE number 3131972 (Why is no real title available?)
• scientific article; zbMATH DE number 3857249 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Algebraic Cryptanalysis of the Data Encryption Standard
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Improved agreeing-gluing algorithm
• Improved randomized algorithms for 3-SAT
• Information and Communications Security
• On solving sparse algebraic equations over finite fields
• Solving multiple right hand sides linear equations
• Sparse algebraic equations over finite fields
• Speeding up deciphering by hypergraph ordering

Cited in

(6)

• Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
• On solving sparse algebraic equations over finite fields
• The minimum rank problem over finite fields
• A combinatorial problem related to sparse systems of equations
• Speeding up deciphering by hypergraph ordering
• An application of combinatorics in cryptography

This page was built for publication: MaxMinMax problem and sparse equations over finite fields

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