On the Security of HFE, HFEv- and Quartz
Authors:
- 18 December 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 2002, 337-350
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Cryptanalysis of SFLASHLecture Notes in Computer Science, 2002
- Short Signatures from the Weil Pairing2001
- How to Achieve a McEliece-Based Digital Signature Scheme2001
- The Security of Hidden Field Equations (HFE)2001
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations2000
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- Algebraic Aspects of Cryptography1998
- Why You Cannot Even Hope to use Gröbner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet FailedJournal of Symbolic Computation, 1994
- Ideals, Varieties, and Algorithms1992
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990