Skip to Main content Skip to Navigation
Conference papers

On the hardness of the NTRU problem

Alice Pellet-Mary 1, 2 Damien Stehlé 3, 4
2 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
3 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03348022
Contributor : Alice Pellet-Mary Connect in order to contact the contributor
Submitted on : Friday, September 17, 2021 - 4:39:18 PM
Last modification on : Saturday, December 4, 2021 - 3:44:02 AM

Identifiers

Collections

Citation

Alice Pellet-Mary, Damien Stehlé. On the hardness of the NTRU problem. Asiacrypt 2021 - 27th Annual International Conference on the Theory and Applications of Cryptology and Information Security, Dec 2021, Singapore, Singapore. ⟨10.1007/978-3-030-92062-3_1⟩. ⟨hal-03348022⟩

Share

Metrics

Record views

30