Efficient algorithms for solving overdefined systems of multivariate polynomial equations
From MaRDI portal
Publication:3374924
Recommendations
Cited in
(only showing first 100 items - show all)- MAYO: practical post-quantum signatures from oil-and-vinegar maps
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- QUAD: A Practical Stream Cipher with Provable Security
- On the complexity of solving quadratic Boolean systems
- GVW algorithm over principal ideal domains
- Stream/block ciphers, difference equations and algebraic attacks
- SoK: how (not) to design and implement post-quantum cryptography
- Multi-round secure light-weight broadcast exclusion protocol with pre-processing
- The group factorization problem in finite groups of Lie type
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- An evolutionary approach to the automatic classification of automorphisms of lower-dimensional Lie algebras
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
- Boolean ring cryptographic equation solving
- Cryptanalysis of the TRMS Signature Scheme of PKC’05
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
- Development of hybrid approach for solving MQ problem: Intermediate hybrid approach
- An improvement of algorithms to solve under-defined systems of multivariate quadratic equations
- A structural attack on block-anti-circulant UOV at SAC 2019
- Flatness and structural analysis as a constructive framework for private communication
- Speeding up the GVW algorithm via a substituting method
- A Highly Scalable RFID Authentication Protocol
- FUTURE: a lightweight block cipher using an optimal diffusion matrix
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Stronger bounds on the cost of computing Gröbner bases for HFE systems
- A new framework for computing Gröbner bases
- Take your MEDS: digital signatures from matrix code equivalence
- scientific article; zbMATH DE number 1962148 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- Enhanced matrix power function for cryptographic primitive construction
- Phase transition of multivariate polynomial systems
- Block ciphers and systems of quadratic equations.
- Characteristic set algorithms for equation solving in finite fields
- Extended multivariate public key cryptosystems with secure encryption function
- Cryptanalysis of a noncommutative key exchange protocol
- 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
- MaxMinMax problem and sparse equations over finite fields
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Semi-regular sequences and other random systems of equations
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- scientific article; zbMATH DE number 2085432 (Why is no real title available?)
- Geometric ideas for cryptographic equation solving in even characteristic
- Algebraic Cryptanalysis of the Data Encryption Standard
- An algebraic attack on rank metric code-based cryptosystems
- (Short paper) Simple matrix signature scheme
- A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV
- Solving multivariate polynomial systems and an invariant from commutative algebra
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- QUAD: A multivariate stream cipher with provable security
- Analysis of Multivariate Hash Functions
- A new signature-based algorithms for computing Gröbner bases
- A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium
- On the complexity of solving generic overdetermined bilinear systems
- IPRainbow
- A Cryptanalysis of the Double-Round Quadratic Cryptosystem
- ElimLin algorithm revisited
- Partition a quantum pure-state set into unambiguously discriminable subsets
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- An improved degree evaluation method of NFSR-based cryptosystems
- Algebraic attacks on round-reduced \textsc{Rain} and full \textsf{AIM-III}
- A multivariate identity-based broadcast encryption with applications to the Internet of Things
- Short solutions to nonlinear systems of equations
- Revisiting the security proof of QUAD stream cipher: some corrections and tighter bounds
- On solving sparse algebraic equations over finite fields
- Solving multiple right hand sides linear equations
- Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and ℓIC-Derivatives
- Mutant Zhuang-Zi algorithm
- New Description of SMS4 by an Embedding overGF(28)
- Algebraic relation of three MinRank algebraic modelings
- 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
- Side Channel Attacks on Irregularly Decimated Generators
- An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG
- Old and new vacua of 5D maximal supergravity
- New Differential-Algebraic Attacks and Reparametrization of Rainbow
- A geometric view of cryptographic equation solving
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- 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
- The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes
- On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
- Nonlinear Piece In Hand Perturbation Vector Method for Enhancing Security of Multivariate Public Key Cryptosystems
- A crossbred algorithm for solving Boolean polynomial systems
- Breaking rainbow takes a weekend on a laptop
- Fast computation of a rational point of a variety over a finite field
- Applying Dixon resultants in cryptography
- Sparse Boolean equations and circuit lattices
- Cryptanalysis of Riccati equation encryption schemes TP-I and TP-II
- Kipnis-Shamir Attack on HFE Revisited
- Guess-and-determine attack and algebraic attack
- The Hidden Root Problem
- An algorithm for solving over-determined multivariate quadratic systems over finite fields
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)