Efficient algorithms for solving overdefined systems of multivariate polynomial equations
From MaRDI portal
Publication:3374924
zbMATH Open1082.94514MaRDI QIDQ3374924FDOQ3374924
Authors: Nicolas Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir 
Publication date: 1 March 2006
Recommendations
Cited In (only showing first 100 items - show all)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
- An improvement of algorithms to solve under-defined systems of multivariate quadratic equations
- Flatness and structural analysis as a constructive framework for private communication
- Speeding up the GVW algorithm via a substituting method
- Phase transition of multivariate polynomial systems
- Enhanced matrix power function for cryptographic primitive construction
- Logical cryptanalysis with WDSat
- Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
- New practical multivariate signatures from a nonlinear modifier
- On the termination of the general XL algorithm and ordinary multinomials
- Sequences, DFT and Resistance against Fast Algebraic Attacks
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Semi-regular sequences and other random systems of equations
- (Short paper) Simple matrix signature scheme
- Solving multivariate polynomial systems and an invariant from commutative algebra
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- An improved degree evaluation method of NFSR-based cryptosystems
- New Description of SMS4 by an Embedding overGF(28)
- Old and new vacua of 5D maximal supergravity
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes
- Fast computation of a rational point of a variety over a finite field
- Sparse Boolean equations and circuit lattices
- Implicit Quadratic Property of Differentially 4-Uniform Permutations
- Instant ciphertext-only cryptanalysis of GSM encrypted communication
- An improved signature model of multivariate polynomial public key cryptosystem against key recovery attack
- Fast correlation attack on stream cipher ABC v3
- The cryptographic power of random selection
- Information Security and Privacy
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Solving quadratic equations with XL on parallel architectures
- A polynomial-time algorithm for solving a class of underdetermined multivariate quadratic equations over fields of odd characteristics
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- Improved cryptanalysis of UOV and Rainbow
- A public key cryptosystem using a group of permutation polynomials
- Algebraic attacks on Rasta and Dasta using low-degree equations
- On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography
- Overdetermined systems of sparse polynomial equations
- Algebraic attacks on the Courtois toy cipher
- On the Number of Linearly Independent Equations Generated by XL
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme
- Resultant elimination via implicit equation interpolation
- Exact solution of a fully general non-local-thermodynamic-equilibrium two-level atom
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
- Algebraic attacks against random local functions and their countermeasures
- 2F -- a new method for constructing efficient multivariate encryption schemes
- Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow
- General Fault Attacks on Multivariate Public Key Cryptosystems
- The inverse of \(\chi\) and its applications to Rasta-like ciphers
- Multivariate public key cryptosystem from Sidon spaces
- A polynomial-time algorithm for solving the hidden subset sum problem
- Stream/block ciphers, difference equations and algebraic attacks
- SoK: how (not) to design and implement post-quantum cryptography
- An evolutionary approach to the automatic classification of automorphisms of lower-dimensional Lie algebras
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- Boolean ring cryptographic equation solving
- FUTURE: a lightweight block cipher using an optimal diffusion matrix
- Title not available (Why is that?)
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Title not available (Why is that?)
- A new framework for computing Gröbner bases
- Block ciphers and systems of quadratic equations.
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
- Stronger bounds on the cost of computing Gröbner bases for HFE systems
- Cryptanalysis of a noncommutative key exchange protocol
- Characteristic set algorithms for equation solving in finite fields
- Extended multivariate public key cryptosystems with secure encryption function
- MaxMinMax problem and sparse equations over finite fields
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- Algebraic Cryptanalysis of the Data Encryption Standard
- Geometric ideas for cryptographic equation solving in even characteristic
- Title not available (Why is that?)
- An algebraic attack on rank metric code-based cryptosystems
- Analysis of Multivariate Hash Functions
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- A Cryptanalysis of the Double-Round Quadratic Cryptosystem
- ElimLin algorithm revisited
- QUAD: A multivariate stream cipher with provable security
- A new signature-based algorithms for computing Gröbner bases
- Side Channel Attacks on Irregularly Decimated Generators
- On solving sparse algebraic equations over finite fields
- Solving multiple right hand sides linear equations
- On the last fall degree of zero-dimensional Weil descent systems
- On the relation between the MXL family of algorithms and Gröbner basis algorithms
- New Differential-Algebraic Attacks and Reparametrization of Rainbow
- A geometric view of cryptographic equation solving
- Operating degrees for XL vs. \(F_{4}/F_{5}\) for generic \(\mathcal{M}Q\) with number of equations linear in that of variables
- Hybrid approach for solving multivariate systems over finite fields
- A crossbred algorithm for solving Boolean polynomial systems
- Applying Dixon resultants in cryptography
- On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
- Kipnis-Shamir Attack on HFE Revisited
- Guess-and-determine attack and algebraic attack
- The Hidden Root Problem
- Cryptanalysis of Riccati equation encryption schemes TP-I and TP-II
- On Cryptographically Significant Mappings over GF(2 n )
Uses Software
This page was built for publication: Efficient algorithms for solving overdefined systems of multivariate polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374924)
