On Polynomial Systems Arising from a Weil Descent

DOI10.1007/978-3-642-34961-4_28zbMath1292.94127OpenAlexW1689674179WikidataQ62047264 ScholiaQ62047264MaRDI QIDQ4911601

Jean-Jacques Quisquater, Christophe Petit

Publication date: 19 March 2013

Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_28

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (21)

On index calculus algorithms for subfield curves ⋮ A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations ⋮ Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Semi-regularity of pairs of Boolean polynomials ⋮ Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two ⋮ First fall degree and Weil descent ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ Index calculus in the trace zero variety ⋮ On the last fall degree of zero-dimensional Weil descent systems ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Homological characterization of bounded \(\mathbb{F}_2\)-regularity ⋮ On the discrete logarithm problem for prime-field elliptic curves ⋮ Unnamed Item ⋮ On the first fall degree of summation polynomials ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ On the last fall degree of Weil descent polynomial systems ⋮ Sandy2x: New Curve25519 Speed Records ⋮ Improvement of FPPR method to solve ECDLP

This page was built for publication: On Polynomial Systems Arising from a Weil Descent