« Retourner aux résultats de recherche

• Citer

First fall degree and Weil descent

par Hodges, Timothy T.J.;Petit, Christophe ;Schlather, Jacob
Référence Finite fields and their applications, 30, page (155-177)
Publication Publié, 2014

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

Polynomial systems arising from a Weil descent have many applications in cryptography, including the HFE cryptosystem and the elliptic curve discrete logarithm problem over small characteristic fields. Understanding the exact complexity of solving these systems is essential for the applications. A first step in that direction is to study the first fall degree of the systems. In this paper, we establish a rigorous general bound on the first fall degree of polynomial systems arising from a Weil descent. We also provide experimental data to study the tightness of our bound in general and its plausible consequences on the complexity of polynomial systems arising from a Weil descent. © 2014 Elsevier Inc.