First fall degree and Weil descent

Hodges, Timothy J.;Schlather, Jacob;Petit, Christophe
(2014) Finite Fields and Their Applications — Vol. 30, p. 155-177 (2014)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 451.92 KB
No access

Details

Authors
  • Hodges, Timothy J.University of Cincinnati
    Author
  • Schlather, JacobUniversity of Cincinnati
    Author
  • Petit, ChristopheUCLouvain
    Author
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Hodges, T. J., Schlather, J., & Petit, C. (2014). First fall degree and Weil descent. Finite Fields and Their Applications, 30, 155-177. https://doi.org/10.1016/j.ffa.2014.07.001 (Original work published 2014)