scientific article; zbMATH DE number 2151220
From MaRDI portal
Publication:4660688
zbMath1072.68664MaRDI QIDQ4660688
Publication date: 4 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method, An improvement for GVW, A Structural Attack on Block-Anti-Circulant UOV at SAC 2019, Multivariate Encryption Schemes Based on Polynomial Equations over Real Numbers, An improvement of a key exchange protocol relying on polynomial maps, 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, Semi-Regular Sequences and Other Random Systems of Equations, A SAT-Based Approach for Index Calculus on Binary Elliptic Curves, A new framework for computing Gröbner bases, Applying cube attacks to stream ciphers in realistic scenarios, On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations, A Secure Variant of the SRP Encryption Scheme with Shorter Private Key, The LaSalle's invariant sets for a class of Lotka-Volterra prey-predator chain systems, A Groebner bases-based approach to backward reasoning in rule based expert systems, Implicit Quadratic Property of Differentially 4-Uniform Permutations, FASTA -- a stream cipher for fast FHE evaluation, Efficiently computing minimal sets of critical pairs, Solving degree, last fall degree, and related invariants, 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, Practical post-quantum signature schemes from isomorphism problems of trilinear forms, New complexity estimation on the rainbow-band-separation attack, Finding multiple Nash equilibria via machine learning-supported Gröbner bases, Semi-regularity of pairs of Boolean polynomials, A New Partial Key Exposure Attack on Multi-power RSA, Computing coupled border bases, A signature based border basis algorithm, Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics, From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures, Torus partition function of the six-vertex model from algebraic geometry, Quasi-subfield polynomials and the elliptic curve discrete logarithm problem, Cryptanalysis of the TRMS Signature Scheme of PKC’05, New Differential-Algebraic Attacks and Reparametrization of Rainbow, Pushforwards via scattering equations with applications to positive geometries, On the computation of rational solutions of underdetermined systems over a finite field, A new algorithm for computing staggered linear bases, Algebraic Attacks against Random Local Functions and Their Countermeasures, The complexity of solving Weil restriction systems, On affine tropical F5 algorithms, Sparse Boolean equations and circuit lattices, Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm, On Cryptographically Significant Mappings over GF(2 n ), Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases, Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme, Involutive bases algorithm incorporating F\(_5\) criterion, An analysis of inhomogeneous signature-based Gröbner basis computations, Algebraic Modelling of Covering Arrays, Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator, GVW algorithm over principal ideal domains, On the efficiency of solving Boolean polynomial systems with the characteristic set method, Square-Vinegar Signature Scheme, Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and ℓIC-Derivatives, Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$, A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers., On some configurations of oppositely charged trapped vortices in the plane, Parallelization of matrix algorithms for Gröbner basis computation, A lattice formulation of the noncommutative F4 procedure, Normal Form Analysis of ℤ2-Equivariant Singularities, From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work, 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, Algebraic Attacks on the Courtois Toy Cipher, 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, Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects, The F5 criterion revised, Kipnis-Shamir Attack on HFE Revisited, Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals, Block-Krylov techniques in the context of sparse-FGLM algorithms, A Multivariate Encryption Scheme with Rainbow, A new encryption scheme for multivariate quadratic systems, A Variant of the F4 Algorithm, Decomposition of polynomial sets into characteristic pairs, Giac and GeoGebra – Improved Gröbner Basis Computations, Square, a New Multivariate Encryption Scheme, Need Polynomial Systems Be Doubly-Exponential?, Cylindrical algebraic decomposition with equational constraints, A Study on Gröbner Basis with Inexact Input, Computing Gröbner Bases within Linear Algebra, Improved Computation of Involutive Bases, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree, A Note on Dynamic Gröbner Bases Computation, A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields, Breaking an Identity-Based Encryption Scheme Based on DHIES, 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, Fast computation of a rational point of a variety over a finite field, Applying Gröbner basis method to multiparametric polynomial nonlinear programming, The inverse of \(\chi\) and its applications to Rasta-like ciphers, A new signature-based algorithms for computing Gröbner bases, \textsc{Azurite}: an algebraic geometry based package for finding bases of loop integrals, On the complexity of the \(F_5\) Gröbner basis algorithm, 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, Structural cryptanalysis of McEliece schemes with compact keys, Computing border bases, Stream/block ciphers, difference equations and algebraic attacks, Stronger bounds on the cost of computing Gröbner bases for HFE systems, SoK: how (not) to design and implement post-quantum cryptography, Polly cracker, revisited, MaxMinMax problem and sparse equations over finite fields, Testing binomiality of chemical reaction networks using comprehensive Gröbner systems, On index calculus algorithms for subfield curves, Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath, Boolean ring cryptographic equation solving, Involutive method for computing Gröbner bases over \(\mathbb F_2\), Role of involutive criteria in computing Boolean Gröbner bases, Exploring the potential energy landscape over a large parameter-space, Matrix-F5 algorithms and tropical Gröbner bases computation, A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings., On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra, Computing comprehensive Gröbner systems: a comparison of two methods, Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic, A new proof for the correctness of the F5 algorithm, A multivariate based threshold ring signature scheme, The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic, Extended \(F_5\) criteria, Gröbner bases for polynomial systems with parameters, F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases, Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases, On the complexity of the generalized MinRank problem, Polynomial bound on the local Betti numbers of a real analytic germ, Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH, First fall degree and Weil descent, Multivariate public key cryptosystems from Diophantine equations, Index calculus in the trace zero variety, On the last fall degree of zero-dimensional Weil descent systems, Resultant elimination via implicit equation interpolation, Characteristic set algorithms for equation solving in finite fields, Optimising Gröbner bases on Bivium, Variant quantifier elimination, Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity, Computing inhomogeneous Gröbner bases, Elliptic curve discrete logarithm problem over small degree extension fields, Solving a binary puzzle, Applying IsRewritten criterion on Buchberger algorithm, Sparse FGLM algorithms, A survey on signature-based algorithms for computing Gröbner bases, Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals, Slimgb: Gröbner bases with slim polynomials, Characteristic decomposition: from regular sets to normal sets, Speeding up the GVW algorithm via a substituting method, Bounded regularity, Computing modular correspondences for abelian varieties, Using symmetries in the index calculus for elliptic curves discrete logarithm, On biunimodular vectors for unitary matrices, Algebraic cryptanalysis of stream ciphers using decomposition of Boolean function, Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity, Parametric FGLM algorithm, Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE, Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited, Pivoting in extended rings for computing approximate Gröbner bases, Solving the 100 swiss francs problem, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, An improvement over the GVW algorithm for inhomogeneous polynomial systems, Complexity of Gröbner basis detection and border basis detection, A logic-algebraic approach to decision taking in a railway interlocking system, 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, Syzygies among reduction operators, 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, Numerical algebraic geometry: a new perspective on gauge and string theories, On the decoding of binary cyclic codes with the Newton identities, An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, Numerical elimination and moduli space of vacua, Thirty years of polynomial system solving, and now?, Solving polynomial systems via symbolic-numeric reduction to geometric involutive form, The discretization for bivariate ideal interpolation, Improvement of FPPR method to solve ECDLP, Solving multiple right hand sides linear equations, On solving sparse algebraic equations over finite fields, Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm, 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, Numerical polynomial homotopy continuation method and string vacua, Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures, A signature-based algorithm for computing Gröbner bases over principal ideal domains, Simple signature based iterative algorithm for calculation of Gröbner bases, الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی, A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV, A multivariate identity-based broadcast encryption with applications to the Internet of Things, Signature Gröbner bases in free algebras over rings, An algorithm for solving over-determined multivariate quadratic systems over finite fields, Refined F5 Algorithms for Ideals of Minors of Square Matrices, An estimator for the hardness of the MQ problem, A signature-based algorithm for computing the nondegenerate locus of a polynomial system, Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow, A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs), Worst-case subexponential attacks on PRGs of constant degree or constant locality, Development of hybrid approach for solving MQ problem: Intermediate hybrid approach, Axioms for a theory of signature bases, Algebraic attacks on Rasta and Dasta using low-degree equations, Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, On the complexity of solving generic overdetermined bilinear systems, Further perspectives on elimination, A new fault attack on UOV multivariate signature scheme, Algebraic relation of three MinRank algebraic modelings, Efficient IBS from a new assumption in the multivariate-quadratic setting, Counting solutions of a polynomial system locally and exactly, Learning with physical rounding for linear and quadratic leakage functions, New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode, Resolvability of Hamming Graphs, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, Analysis of Multivariate Hash Functions, Finding Fuzzy Inverse Matrix Using Wu’s Method, On the construction of staggered linear bases, Computation of invariants of finite abelian groups, Algebraic Cryptanalysis of the Data Encryption Standard, Exact line and plane search for tensor optimization, On the complexity of computing Gröbner bases for weighted homogeneous systems, Orthogonal designs via computational algebra, Specific S-Box Criteria in Algebraic Attacks on Block Ciphers with Several Known Plaintexts, Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology, Solving fuzzy complex system of linear equations using eigenvalue method
Uses Software
