The following pages link to (Q4660688):
Displaying 50 items.
- Simple signature based iterative algorithm for calculation of Gröbner bases (Q263239) (← links)
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Polly cracker, revisited (Q285245) (← links)
- MaxMinMax problem and sparse equations over finite fields (Q285259) (← 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)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- A new proof for the correctness of the F5 algorithm (Q365812) (← links)
- A multivariate based threshold ring signature scheme (Q371251) (← 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)
- Variant quantifier elimination (Q420753) (← links)
- Bounded regularity (Q479798) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- On biunimodular vectors for unitary matrices (Q491106) (← links)
- Algebraic cryptanalysis of stream ciphers using decomposition of Boolean function (Q500004) (← links)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← 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)
- Extended \(F_5\) criteria (Q607057) (← links)
- Gröbner bases for polynomial systems with parameters (Q607062) (← links)
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases (Q607065) (← links)
- Optimising Gröbner bases on Bivium (Q626947) (← links)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- Computing inhomogeneous Gröbner bases (Q633077) (← links)
- Applying IsRewritten criterion on Buchberger algorithm (Q638523) (← links)
- Computing modular correspondences for abelian varieties (Q661914) (← 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)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography (Q733509) (← links)
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
- Numerical elimination and moduli space of vacua (Q737597) (← links)
- The discretization for bivariate ideal interpolation (Q738964) (← links)
- Improvement of FPPR method to solve ECDLP (Q740119) (← links)
- Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm (Q744015) (← links)
- Numerical polynomial homotopy continuation method and string vacua (Q765439) (← links)
- Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures (Q780363) (← links)
- A signature-based algorithm for computing Gröbner bases over principal ideal domains (Q782709) (← links)
- Computing border bases (Q819794) (← links)
- Stream/block ciphers, difference equations and algebraic attacks (Q820950) (← links)
- Stronger bounds on the cost of computing Gröbner bases for HFE systems (Q820971) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
