Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 30-47
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Comparison Between XL and Gröbner Basis Algorithms2004
- A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms2003
- A Traceable Block CipherLecture Notes in Computer Science, 2003
- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases2003
- Attacking the Affine Parts of SFLASHLecture Notes in Computer Science, 2001
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’881995
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory1985