Comparison Between XL and Gröbner Basis Algorithms
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Comparison Between XL and Gröbner Basis AlgorithmsPublished by Springer Nature ,2004
- Algebraic Attacks on Stream Ciphers with Linear FeedbackPublished by Springer Nature ,2003
- Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of ToyocryptPublished by Springer Nature ,2003
- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner BasesPublished by Springer Nature ,2003
- Fast Algebraic Attacks on Stream Ciphers with Linear FeedbackPublished by Springer Nature ,2003
- Algebraic Attacks on Combiners with MemoryPublished by Springer Nature ,2003
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric AlgorithmsPublished by Springer Nature ,1996
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88Published by Springer Nature ,1995
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993