Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
Author:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 33-48
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’881995
- A new identification scheme based on syndrome decoding1994
- Computing Frobenius maps and factoring polynomials1992
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- A geometric approach to root finding in GT(q/sup m/)IEEE Transactions on Information Theory, 1989
- Some computational aspects of root finding in GF(qm)Lecture Notes in Computer Science, 1989
- Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption1988
- A note on the complexity of cryptography (Corresp.)IEEE Transactions on Information Theory, 1979