Attaque algebrique de NTRU a l'aide des vecteurs de Witt
Gerald Bourgeois

TL;DR
This paper enhances an algebraic attack on NTRU by utilizing more bits of Witt vectors, leading to additional equations and improved attack effectiveness.
Contribution
It extends Silverman, Smart, and Vercauteren's algebraic attack by considering four bits of Witt vectors instead of two, adding higher-degree equations.
Findings
Increased number of equations for the attack
Improved success rate of the algebraic attack
Demonstrated effectiveness on NTRU variants
Abstract
One improves an algebraic attack of NTRU due to Silverman, Smart and Vercauteren; the latter considered the first 2 bits of a Witt vector attached to the research of the secret key; here the first 4 bits are considered, which provides additional equations of degrees 4 and 8.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Intelligence, Security, War Strategy
