Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms

This publication has 9 references indexed in Scilit:

• An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
  Published by Springer Nature ,2001
• Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88
  Published by Springer Nature ,1995
• A new identification scheme based on syndrome decoding
  Published by Springer Nature ,1994
• Computing Frobenius maps and factoring polynomials
  Published by Association for Computing Machinery (ACM) ,1992
• Matrix multiplication via arithmetic progressions
  Journal 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)
  Published by Springer Nature ,1989
• Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption
  Published by Springer Nature ,1988
• A note on the complexity of cryptography (Corresp.)
  IEEE Transactions on Information Theory, 1979