A Variant of the F4 Algorithm
From MaRDI portal
Recommendations
- A variation on the Boyer-Moore algorithm
- scientific article; zbMATH DE number 123347
- A modification of krawczyk's algorithm
- A modified version of the Waxman algorithm
- scientific article; zbMATH DE number 34575
- A dynamic F4 algorithm to compute Gröbner bases
- Fourier algorithm revisited
- A rupestrian algorithm
- scientific article; zbMATH DE number 1131789
- scientific article; zbMATH DE number 5984
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- Advances in Cryptology - CRYPTO 2003
- Algebraic Cryptanalysis
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Comprehensive Gröbner bases
- Cryptanalysis of MinRank
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
- scientific article; zbMATH DE number 6696214 (Why is no real title available?)
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 62658 (Why is no real title available?)
- scientific article; zbMATH DE number 2081078 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- Hybrid approach for solving multivariate systems over finite fields
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- On an installation of Buchberger's algorithm
- On the decoding of binary cyclic codes with the Newton identities
- Some comments on the modular approach to Gröbner-bases
- The Magma algebra system. I: The user language
- Unbalanced Oil and Vinegar Signature Schemes
Cited in
(7)- Elliptic curve discrete logarithm problem over small degree extension fields
- Giac and GeoGebra -- improved Gröbner basis computations
- Algebraic attacks from a Groebner basis perspective
- Flexible partial enlargement to accelerate Gröbner basis computation over \(\mathbb{F}_2\)
- M4GB. An efficient Gröbner-basis algorithm
- Improvement of FPPR method to solve ECDLP
- Index calculus in the trace zero variety
This page was built for publication: A Variant of the F4 Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073717)
