scientific article; zbMATH DE number 2151220
From MaRDI portal
Publication:4660688
Recommendations
Cited in
(only showing first 100 items - show all)- Thirty years of polynomial system solving, and now?
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Solving multiple right hand sides linear equations
- On solving sparse algebraic equations over finite fields
- On an installation of Buchberger's algorithm
- A new efficient algorithm for computing Gröbner bases (F₄)
- Computing comprehensive Gröbner systems: a comparison of two methods
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Polynomial bound on the local Betti numbers of a real analytic germ
- On the last fall degree of zero-dimensional Weil descent systems
- Resultant elimination via implicit equation interpolation
- Solving a binary puzzle
- Sparse FGLM algorithms
- A survey on signature-based algorithms for computing Gröbner bases
- Characteristic decomposition: from regular sets to normal sets
- Speeding up the GVW algorithm via a substituting method
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE
- Complexity of Gröbner basis detection and border basis detection
- Syzygies among reduction operators
- Numerical algebraic geometry: a new perspective on gauge and string theories
- Multivariate public key cryptosystems from Diophantine equations
- Elliptic curve discrete logarithm problem over small degree extension fields
- Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
- Slimgb: Gröbner bases with slim polynomials
- Using machine learning to improve cylindrical algebraic decomposition
- On the first fall degree of summation polynomials
- On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases
- Termination of the F5 algorithm
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- A comparison of unrestricted dynamic Gröbner basis algorithms
- A generic and executable formalization of signature-based Gröbner basis algorithms
- Solving non-linear Boolean equation systems by variable elimination
- Cryptanalysis of the extension field cancellation cryptosystem
- Efficiently and effectively recognizing toricity of steady state varieties
- An involutive GVW algorithm and the computation of Pommaret bases
- Relative Gröbner and involutive bases for ideals in quotient rings
- An algebraic attack on rank metric code-based cryptosystems
- Improved cryptanalysis of UOV and Rainbow
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- A public key cryptosystem using a group of permutation polynomials
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Guessing Gröbner bases of structured ideals of relations of sequences
- Security analysis via algebraic attack against ``a new encryption scheme for multivariate quadratic system
- A study on randomness used in signature generation of UOV
- Symbolic computation for the qualitative theory of differential equations
- The inverse of \(\chi\) and its applications to Rasta-like ciphers
- \textsc{Azurite}: an algebraic geometry based package for finding bases of loop integrals
- Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
- Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method
- An improvement for GVW
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems
- Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
- FASTA -- a stream cipher for fast FHE evaluation
- Solving degree, last fall degree, and related invariants
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases
- Computing coupled border bases
- A signature based border basis algorithm
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
- On affine tropical F5 algorithms
- 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 some configurations of oppositely charged trapped vortices in the plane
- Counting and enumerating feasible rotating schedules by means of Gröbner bases
- On the termination of the general XL algorithm and ordinary multinomials
- Solving multivariate polynomial systems and an invariant from commutative algebra
- Fast correlation attack on stream cipher ABC v3
- Improved agreeing-gluing algorithm
- A new algorithm for the generation of unitarity-compatible integration by parts relations
- The F5 criterion revised
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- A new encryption scheme for multivariate quadratic systems
- Cylindrical algebraic decomposition with equational constraints
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
- A new signature-based algorithms for computing Gröbner bases
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Applying cube attacks to stream ciphers in realistic scenarios
- A Groebner bases-based approach to backward reasoning in rule based expert systems
- Local reduction and the algebraic cryptanalysis of the block cipher GOST
- Cryptanalysis of RGB, a mixed multivariate signature scheme
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
- Torus partition function of the six-vertex model from algebraic geometry
- Sparse Boolean equations and circuit lattices
- Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm
- Involutive bases algorithm incorporating F\(_5\) criterion
- An analysis of inhomogeneous signature-based Gröbner basis computations
- GVW algorithm over principal ideal domains
- A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers.
- Parallelization of matrix algorithms for Gröbner basis computation
- Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y]\)
- Simple signature based iterative algorithm for calculation of Gröbner bases
- On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations
- The LaSalle's invariant sets for a class of Lotka-Volterra prey-predator chain systems
- Structural cryptanalysis of McEliece schemes with compact keys
- Efficiently computing minimal sets of critical pairs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660688)
