Key Recovery on Hidden Monomial Multivariate Schemes - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Key Recovery on Hidden Monomial Multivariate Schemes

Résumé

The problem we study in this paper is the key recovery problem on the C* schemes and generalizations where the quadratic monomial of C* (the product of two linear monomials) is replaced by a product of three or more linear monomials. This problem has been further generalized to any multivariate polynomial hidden by two invertible linear maps and named the Isomorphism of Polynomials (I P ) problem by Patarin et al. Some cryptosystems have been built on this appearing hard problem such as a traitor tracing scheme proposed by Billet and Gilbert. Here we show that if the hidden multivariate monomial is a quadratic monomial, as in SFLASH, or a cubic (or higher) monomial as in the traitor tracing scheme, then it is possible to recover an equivalent secret key in polynomial time O(nd ) where n is the number of variables and d is the degree of the public polynomials.
Fichier principal
Vignette du fichier
euro08a.pdf (141.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00556685 , version 1 (17-01-2011)

Identifiants

Citer

Pierre-Alain Fouque, Gilles Macario-Rat, Jacques Stern. Key Recovery on Hidden Monomial Multivariate Schemes. Advances in Cryptology - EUROCRYPT 2008 : 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2008, Istanbul, Turkey. pp.19-30, ⟨10.1007/978-3-540-78967-3_2⟩. ⟨inria-00556685⟩
78 Consultations
122 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More