scientific article; zbMATH DE number 2151220

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 (only showing first 100 items - show all)

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

Uses Software

This page was built for publication: