Comparison Between XL and Gröbner Basis Algorithms
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Comparison Between XL and Gröbner Basis AlgorithmsLecture Notes in Computer Science, 2004
- Algebraic Attacks on Stream Ciphers with Linear FeedbackLecture Notes in Computer Science, 2003
- Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of ToyocryptLecture Notes in Computer Science, 2003
- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner BasesLecture Notes in Computer Science, 2003
- Fast Algebraic Attacks on Stream Ciphers with Linear FeedbackLecture Notes in Computer Science, 2003
- Algebraic Attacks on Combiners with MemoryLecture Notes in Computer Science, 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 AlgorithmsLecture Notes in Computer Science, 1996
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88Lecture Notes in Computer Science, 1995
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993