First fall degree and Weil descent |
| |
Affiliation: | 1. University of Cincinnati, Cincinnati, OH 45221-0025, USA;2. Université Catholique de Louvain, 1348 Louvain-la-Neuve, Belgium |
| |
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. |
| |
Keywords: | First fall degree Weil descent Finite field Degree of regularity |
本文献已被 ScienceDirect 等数据库收录! |
|