A crossbred algorithm for solving Boolean polynomial systems
From MaRDI portal
Publication:2636455
DOI10.1007/978-3-319-76620-1_1zbMath1423.94078OpenAlexW2620600500MaRDI QIDQ2636455
Publication date: 5 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76620-1_1
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)
Related Items (12)
SoK: how (not) to design and implement post-quantum cryptography ⋮ A Rank Attack Against Extension Field Cancellation ⋮ A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ An estimator for the hardness of the MQ problem ⋮ A multivariate cryptosystem inspired by random linear codes ⋮ Solving non-linear Boolean equation systems by variable elimination ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\) ⋮ Practical complexities of probabilistic algorithms for solving Boolean polynomial systems ⋮ Preimage attacks on 4-round Keccak by solving multivariate quadratic systems ⋮ Logical cryptanalysis with WDSat ⋮ Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
This page was built for publication: A crossbred algorithm for solving Boolean polynomial systems
