Pages that link to "Item:Q1295781"
From MaRDI portal
The following pages link to A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields (Q268465) (← links)
- Polly cracker, revisited (Q285245) (← links)
- MaxMinMax problem and sparse equations over finite fields (Q285259) (← links)
- The F5 algorithm in Buchberger's style (Q301017) (← links)
- Exploring the potential energy landscape over a large parameter-space (Q303477) (← links)
- A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings. (Q317652) (← links)
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra (Q328226) (← links)
- Resolution of a system of fuzzy polynomial equations using eigenvalue method (Q344053) (← links)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- Stability analysis for discrete biological models using algebraic methods (Q359890) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- A new proof for the correctness of the F5 algorithm (Q365812) (← links)
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases (Q382761) (← links)
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH (Q404920) (← links)
- First fall degree and Weil descent (Q405966) (← links)
- Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
- On the relation between the MXL family of algorithms and Gröbner basis algorithms (Q414624) (← links)
- Variant quantifier elimination (Q420753) (← links)
- Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\) (Q432760) (← links)
- Delsarte method in the problem on kissing numbers in high-dimensional spaces (Q483413) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- SimpleMatrix -- a multivariate public key cryptosystem (MPKC) for encryption (Q492017) (← links)
- Algebraic cryptanalysis of stream ciphers using decomposition of Boolean function (Q500004) (← links)
- Parametric FGLM algorithm (Q512366) (← links)
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited (Q527403) (← links)
- An improvement over the GVW algorithm for inhomogeneous polynomial systems (Q530403) (← links)
- Gröbner bases and wavelet design (Q597059) (← links)
- Extended \(F_5\) criteria (Q607057) (← links)
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases (Q607065) (← links)
- On the determination of cusp points of 3-RPR parallel manipulators (Q612672) (← links)
- Optimising Gröbner bases on Bivium (Q626947) (← links)
- Obtaining and solving systems of equations in key variables only for the small variants of AES (Q626949) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- Artificial discontinuities of single-parametric Gröbner bases (Q629351) (← links)
- Isochronicity conditions for some planar polynomial systems. II. (Q630626) (← links)
- Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation (Q632158) (← links)
- The F\(_{4}\)-algorithm for Euclidean rings (Q632251) (← links)
- Computing inhomogeneous Gröbner bases (Q633077) (← links)
- Applying IsRewritten criterion on Buchberger algorithm (Q638523) (← links)
- Computing modular correspondences for abelian varieties (Q661914) (← links)
- Distortion varieties (Q667656) (← links)
- Analysis of codimension 2 bifurcations for high-dimensional discrete systems using symbolic computation methods (Q668564) (← links)
- Pivoting in extended rings for computing approximate Gröbner bases (Q691644) (← links)
- Solving the 100 swiss francs problem (Q691647) (← links)
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems (Q691650) (← links)
- A logic-algebraic approach to decision taking in a railway interlocking system (Q694549) (← links)
- Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
