MaxMinMax problem and sparse equations over finite fields
From MaRDI portal
Publication:285259
DOI10.1007/S10623-015-0058-6zbMATH Open1347.11083OpenAlexW2048963076MaRDI QIDQ285259FDOQ285259
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Solving multiple right hand sides linear equations
- On solving sparse algebraic equations over finite fields
- Improved agreeing-gluing algorithm
- Speeding up deciphering by hypergraph ordering
- Improved Randomized Algorithms for 3-SAT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sparse Algebraic Equations over Finite Fields
- Algebraic Cryptanalysis of the Data Encryption Standard
- Information and Communications Security
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
Cited In (5)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
- The minimum rank problem over finite fields
- An application of combinatorics in cryptography
- Speeding up deciphering by hypergraph ordering
- A combinatorial problem related to sparse systems of equations
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)
