A Variant of the F4 Algorithm
From MaRDI portal
Publication:3073717
DOI10.1007/978-3-642-19074-2_23zbMATH Open1272.94039OpenAlexW1480389758MaRDI QIDQ3073717FDOQ3073717
Authors: Antoine Joux, Vanessa Vitse 
Publication date: 11 February 2011
Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19074-2_23
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
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- The Magma algebra system. I: The user language
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Title not available (Why is that?)
- On the decoding of binary cyclic codes with the Newton identities
- Title not available (Why is that?)
- Algebraic Cryptanalysis
- Advances in Cryptology - CRYPTO 2003
- Comprehensive Gröbner bases
- Title not available (Why is that?)
- Hybrid approach for solving multivariate systems over finite fields
- Cryptanalysis of MinRank
- Unbalanced Oil and Vinegar Signature Schemes
- Title not available (Why is that?)
- On an installation of Buchberger's algorithm
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Some comments on the modular approach to Gröbner-bases
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Index calculus in the trace zero variety
- Improvement of FPPR method to solve ECDLP
- Flexible partial enlargement to accelerate Gröbner basis computation over \(\mathbb{F}_2\)
- Algebraic attacks from a Groebner basis perspective
- Giac and GeoGebra -- improved Gröbner basis computations
- M4GB. An efficient Gröbner-basis algorithm
- Elliptic curve discrete logarithm problem over small degree extension fields
Uses Software
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)
