Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
Top Cited Papers
- 1 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Cryptanalysis of SFLASHPublished by Springer Nature ,2002
- The Security of Hidden Field Equations (HFE)Published by Springer Nature ,2001
- Cryptanalysis of the HFE Public Key Cryptosystem by RelinearizationPublished by Springer Nature ,1999
- 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
- A Block Lanczos Algorithm for Finding Dependencies over GF(2)Published by Springer Nature ,1995
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88Published by Springer Nature ,1995
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann AlgorithmMathematics of Computation, 1994
- Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-EncryptionPublished by Springer Nature ,1988
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970