Mostrar el registro sencillo del ítem

hal.structure.identifierCentre National de la Recherche Scientifique [CNRS]
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
dc.contributor.authorPELLET-MARY, Alice
hal.structure.identifierArithmetic and Computing [ARIC]
hal.structure.identifierÉcole normale supérieure de Lyon [ENS de Lyon]
dc.contributor.authorSTEHLÉ, Damien
dc.date.accessioned2024-04-04T02:45:35Z
dc.date.available2024-04-04T02:45:35Z
dc.date.issued2021-12-01
dc.date.conference2021-12-05
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191480
dc.description.abstractEnThe 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.isoen
dc.title.enOn the hardness of the NTRU problem
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-030-92062-3_1
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
dc.description.sponsorshipEuropePRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleAsiacrypt 2021 - 27th Annual International Conference on the Theory and Applications of Cryptology and Information Security
bordeaux.countrySG
bordeaux.conference.citySingapore
bordeaux.peerReviewedoui
hal.identifierhal-03348022
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2021-12-09
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03348022v1
bordeaux.COinSctx_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

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem