On the first fall degree of summation polynomials
DOI10.1515/jmc-2017-0022zbMath1427.13039arXiv1906.05594OpenAlexW2949770067MaRDI QIDQ2009417
Stavros Kousidis, Andreas Wiemers
Publication date: 28 November 2019
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.05594
Gröbner basesdiscrete logarithm problemelliptic curve cryptosystemfirst fall degreepolynomials systems
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Elliptic curves (14H52) Solving polynomial systems; resultants (13P15) Research data for problems pertaining to commutative algebra (13-11)
Cites Work
- First fall degree and Weil descent
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Degree of Regularity of HFE Systems
- On the discrete logarithm problem in elliptic curves
- Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
- On Polynomial Systems Arising from a Weil Descent
- Inverting HFE Systems Is Quasi-Polynomial for All Fields
- Advances in Cryptology - CRYPTO 2003
- Inverting HFE Is Quasipolynomial
- Unnamed Item
- Unnamed Item
This page was built for publication: On the first fall degree of summation polynomials