Isomorphism of Polynomials : New Results

@inproceedings{Bouillaguet2009IsomorphismOP,
  title={Isomorphism of Polynomials : New Results},
  author={Charles Bouillaguet and Jean-Charles Faug{\`e}re and Pierre-Alain Fouque and Ludovic Perret},
  year={2009}
}
In this paper, we investigate the difficulty of the Isomorphism of Polynomials (IP) Problem as well as one of its variant IP1S. The Isomorphism of Polynomials is a well-known problem studied in multivariate cryptography. It is related to the hardness of the key recovery of some cryptosystems. The problem is the following: given two families of multivariate polynomials a and b, find two invertible linear (or affine) mappings S and T such that b = T ◦a◦S. For IP1S, we suppose that T is the… CONTINUE READING