Efficient algorithms for solving overdefined systems of multivariate polynomial equations
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Solving multiple right hand sides linear equations
- On solving sparse algebraic equations over finite fields
- Instant ciphertext-only cryptanalysis of GSM encrypted communication
- On the last fall degree of zero-dimensional Weil descent systems
- Resultant elimination via implicit equation interpolation
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Speeding up the GVW algorithm via a substituting method
- Flatness and structural analysis as a constructive framework for private communication
- Cryptanalysis of Riccati equation encryption schemes TP-I and TP-II
- An application of algebraic geometry to encryption: tame transformation method
- On the complexity of solving quadratic Boolean systems
- Multivariate public key cryptosystems from Diophantine equations
- Solving non-linear Boolean equation systems by variable elimination
- Old and new vacua of 5D maximal supergravity
- An improved signature model of multivariate polynomial public key cryptosystem against key recovery attack
- An algebraic attack on rank metric code-based cryptosystems
- The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes
- Improved cryptanalysis of UOV and Rainbow
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- A public key cryptosystem using a group of permutation polynomials
- Multivariate public key cryptosystem from Sidon spaces
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- The inverse of \(\chi\) and its applications to Rasta-like ciphers
- Exact solution of a fully general non-local-thermodynamic-equilibrium two-level atom
- A polynomial-time algorithm for solving the hidden subset sum problem
- Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Logical cryptanalysis with WDSat
- Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
- New practical multivariate signatures from a nonlinear modifier
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- (Short paper) Simple matrix signature scheme
- Solving degree, last fall degree, and related invariants
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- On the termination of the general XL algorithm and ordinary multinomials
- Solving multivariate polynomial systems and an invariant from commutative algebra
- An improved degree evaluation method of NFSR-based cryptosystems
- Fast correlation attack on stream cipher ABC v3
- Improved agreeing-gluing algorithm
- A new encryption scheme for multivariate quadratic systems
- Speeding up deciphering by hypergraph ordering
- Overdetermined systems of sparse polynomial equations
- A new signature-based algorithms for computing Gröbner bases
- Cryptanalysis of a noncommutative key exchange protocol
- Partition a quantum pure-state set into unambiguously discriminable subsets
- Applying cube attacks to stream ciphers in realistic scenarios
- Two philosophies for solving non-linear equations in algebraic cryptanalysis
- Enhanced matrix power function for cryptographic primitive construction
- Sparse Boolean equations and circuit lattices
- GVW algorithm over principal ideal domains
- Designing against a class of algebraic attacks on symmetric block ciphers
- Consensus networks over finite fields
- A crossbred algorithm for solving Boolean polynomial systems
- Short solutions to nonlinear systems of equations
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
- Quantum security of grain-128/grain-128a stream cipher against HHL algorithm
- The complexity of solving Weil restriction systems
- Using small-scale quantum devices to solve algebraic equations
- Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme
- MaxMinMax problem and sparse equations over finite fields
- On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography
- Operating degrees for XL vs. \(F_{4}/F_{5}\) for generic \(\mathcal{M}Q\) with number of equations linear in that of variables
- The cryptographic power of random selection
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Solving underdetermined systems of multivariate quadratic equations revisited
- A polynomial-time algorithm for solving a class of underdetermined multivariate quadratic equations over fields of odd characteristics
- Computing border bases using mutant strategies
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- Revisiting the security proof of QUAD stream cipher: some corrections and tighter bounds
- Algebraic attacks on the Courtois toy cipher
- scientific article; zbMATH DE number 2085432 (Why is no real title available?)
- A Variant of the F4 Algorithm
- Guess-and-determine attack and algebraic attack
- Hill climbing algorithms and Trivium
- General Fault Attacks on Multivariate Public Key Cryptosystems
- On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
- The shortest signatures ever
- Implicit Quadratic Property of Differentially 4-Uniform Permutations
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
- Hybrid approach for solving multivariate systems over finite fields
- Fast computation of a rational point of a variety over a finite field
- Evaluation of solving time for multivariate quadratic equation system using XL algorithm over small finite fields on GPU
- A new framework for computing Gröbner bases
- Cryptanalysis of the TRMS Signature Scheme of PKC’05
- New Differential-Algebraic Attacks and Reparametrization of Rainbow
- A geometric view of cryptographic equation solving
- On Cryptographically Significant Mappings over GF(2 n )
- Algebraic and Slide Attacks on KeeLoq
- Differential Fault Analysis of Trivium
- Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator
- Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and ℓIC-Derivatives
- Nonlinear Piece In Hand Perturbation Vector Method for Enhancing Security of Multivariate Public Key Cryptosystems
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- A Five-Round Algebraic Property of the Advanced Encryption Standard
- Mutant Zhuang-Zi algorithm
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
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)
