Mostrar el registro sencillo del ítem
On the hardness of the NTRU problem
hal.structure.identifier | Centre National de la Recherche Scientifique [CNRS] | |
hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
dc.contributor.author | PELLET-MARY, Alice | |
hal.structure.identifier | Arithmetic and Computing [ARIC] | |
hal.structure.identifier | École normale supérieure de Lyon [ENS de Lyon] | |
dc.contributor.author | STEHLÉ, Damien | |
dc.date.accessioned | 2024-04-04T02:45:35Z | |
dc.date.available | 2024-04-04T02:45:35Z | |
dc.date.issued | 2021-12-01 | |
dc.date.conference | 2021-12-05 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191480 | |
dc.description.abstractEn | The 25 year-old NTRU problem is an important computational assumption in public-key cryptography. However, from a reduction perspective, its relative hardness compared to other problems on Euclidean lattices is not well-understood. Its decision version reduces to the search Ring-LWE problem, but this only provides a hardness upper bound.We provide two answers to the long-standing open problem of providing reduction-based evidence of the hardness of the NTRU problem. First, we reduce the worst-case approximate Shortest Vector Problem over ideal lattices to an average-case search variant of the NTRU problem. Second, we reduce another average-case search variant of the NTRU problem to the decision NTRU problem. | |
dc.language.iso | en | |
dc.title.en | On the hardness of the NTRU problem | |
dc.type | Communication dans un congrès | |
dc.identifier.doi | 10.1007/978-3-030-92062-3_1 | |
dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
dc.description.sponsorshipEurope | PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS | |
bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.conference.title | Asiacrypt 2021 - 27th Annual International Conference on the Theory and Applications of Cryptology and Information Security | |
bordeaux.country | SG | |
bordeaux.conference.city | Singapore | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-03348022 | |
hal.version | 1 | |
hal.invited | non | |
hal.proceedings | oui | |
hal.conference.end | 2021-12-09 | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-03348022v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2021-12-01&rft.au=PELLET-MARY,%20Alice&STEHL%C3%89,%20Damien&rft.genre=unknown |
Archivos en el ítem
Archivos | Tamaño | Formato | Ver |
---|---|---|---|
No hay archivos asociados a este ítem. |