Welcome to the resource topic for 2013/799
Title:
New Insight into the Isomorphism of Polynomials problem IP1S and its Use in Cryptography
Authors: Gilles Macario-Rat, Jérôme Plût, Henri Gilbert
Abstract:This paper investigates the mathematical structure of the ``Isomorphism of Polynomial with One Secret’’ problem (IP1S). Our purpose is to understand why for practical parameter values of IP1S most random instances are easily solvable (as first observed by Bouillaguet et al.). We show that the structure of the problem is directly linked to the structure of quadratic forms in odd and even characteristic. We describe a completely new method allowing to efficiently solve most instances. Unlike previous solving techniques, this is not based upon Gröbner basis computations.
ePrint: https://eprint.iacr.org/2013/799
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .