Paper 2009/583
Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem
Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, and Ludovic Perret
Abstract
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 more particularly in
multivariate cryptography as it is related to the hardness of the key
recovery of such cryptosystems. The problem is the following: given
two families of multivariate polynomials~
Note: Update version with new algorithms.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- cryptanalysisHFEGroebner BasesIsomorphism of Polynomials
- Contact author(s)
- charles bouillaguet @ ens fr
- History
- 2010-02-19: revised
- 2009-12-01: received
- See all versions
- Short URL
- https://ia.cr/2009/583
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/583, author = {Charles Bouillaguet and Jean-Charles Faugère and Pierre-Alain Fouque and Ludovic Perret}, title = {Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/583}, year = {2009}, url = {https://eprint.iacr.org/2009/583} }