Efficient Key Recovery for All HFE Signature Variants
Authors:
- 11 August 2021
- book chapter
- Published by Springer Nature
- p. 70-93
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Inverting square systems algebraically is exponentialFinite Fields and Their Applications, 2014
- Degree of Regularity for HFEv and HFEv-Lecture Notes in Computer Science, 2013
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristicDesigns, Codes and Cryptography, 2012
- Equivalent keys in ℳultivariate uadratic public key systemsJournal of Mathematical Cryptology, 2011
- Kipnis-Shamir Attack on HFE RevisitedLecture Notes in Computer Science, 2008
- On the Security of HFE, HFEv- and QuartzLecture Notes in Computer Science, 2002
- Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization1999
- The Computational Complexity of Some Problems of Linear AlgebraJournal of Computer and System Sciences, 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 Algorithms1996