MaxMinMax problem and sparse equations over finite fields
From MaRDI portal
Publication:285259
DOI10.1007/s10623-015-0058-6zbMath1347.11083OpenAlexW2048963076MaRDI QIDQ285259
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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (4)
Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems ⋮ An application of combinatorics in cryptography ⋮ A combinatorial problem related to sparse systems of equations ⋮ Speeding up deciphering by hypergraph ordering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving multiple right hand sides linear equations
- On solving sparse algebraic equations over finite fields
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Improved agreeing-gluing algorithm
- Speeding up deciphering by hypergraph ordering
- Improved Randomized Algorithms for 3-SAT
- Sparse Algebraic Equations over Finite Fields
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Algebraic Cryptanalysis of the Data Encryption Standard
- Information and Communications Security
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
This page was built for publication: MaxMinMax problem and sparse equations over finite fields