A Variant of the F4 Algorithm
From MaRDI portal
Publication:3073717
DOI10.1007/978-3-642-19074-2_23zbMath1272.94039OpenAlexW1480389758MaRDI QIDQ3073717
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
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (4)
Index calculus in the trace zero variety ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Giac and GeoGebra – Improved Gröbner Basis Computations ⋮ Improvement of FPPR method to solve ECDLP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
- On the decoding of binary cyclic codes with the Newton identities
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- On an installation of Buchberger's algorithm
- Comprehensive Gröbner bases
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- Some comments on the modular approach to Gröbner-bases
- Hybrid approach for solving multivariate systems over finite fields
- Algebraic Cryptanalysis
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- Cryptanalysis of MinRank
- Unbalanced Oil and Vinegar Signature Schemes
- Advances in Cryptology - CRYPTO 2003
This page was built for publication: A Variant of the F4 Algorithm