Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
type: Item
instance of: scholarly article
title: Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
zbMATH Open document ID: 1479.94157
DOI: 10.1007/978-3-030-77870-5_14
author: Itai Dinur
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68W01
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7440586
zbMATH Keywords: complexity of algorithms
zbMATH Keywords: polynomial equation systems
MaRDI profile type: Publication
full work available at URL: 978-3-030-77870-5 14
OpenAlex ID: W3169109595
cites work: Ciphers for MPC and FHE
cites work: On the complexity of solving quadratic Boolean systems
cites work: Keccak
cites work: On the Indifferentiability of the Sponge Construction
cites work: Q5091175
cites work: Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
cites work: Q3374924
cites work: Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
cites work: Cube Attacks on Tweakable Black Box Polynomials
cites work: An Improved Algebraic Attack on Hamsi-256
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q4660688
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Linear Structures: Applications to Cryptanalysis of Round-Reduced Keccak
cites work: Algorithmic Cryptanalysis
cites work: A crossbred algorithm for solving Boolean polynomial systems
cites work: Unbalanced Oil and Vinegar Signature Schemes
cites work: Preimage attacks on round-reduced Keccak-224/256 via an allocating approach
cites work: Beating Brute Force for Systems of Polynomial Equations over Finite Fields
cites work: Rotational Cryptanalysis of Round-Reduced Keccak
cites work: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
cites work: NP is as easy as detecting unique solutions
cites work: Q3299223
description: scientific article; zbMATH DE number 7440586