Mostrar el registro sencillo del ítem

Towards practical key exchange from ordinary isogeny graphs

hal.structure.identifierLaboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
hal.structure.identifierLaboratoire de Mathématiques de Versailles [LMV]
dc.contributor.authorDE FEO, Luca
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierÉcole normale supérieure - Paris [ENS-PSL]
dc.contributor.authorKIEFFER, Jean
hal.structure.identifierGeometry, arithmetic, algorithms, codes and encryption [GRACE]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorSMITH, Benjamin
dc.date.accessioned2024-04-04T03:05:14Z
dc.date.available2024-04-04T03:05:14Z
dc.date.conference2018-12-02
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193226
dc.description.abstractEnWe revisit the ordinary isogeny-graph based cryptosystems of Couveignes and Rostovtsev-Stolbunov, long dismissed as impractical. We give algorithmic improvements that accelerate key exchange in this framework, and explore the problem of generating suitable system parameters for contemporary pre-and post-quantum security that take advantage of these new algorithms. We also prove the session-key security of this key exchange in the Canetti-Krawczyk model, and the IND-CPA security of the related public-key encryption scheme, under reasonable assumptions on the hardness of computing isogeny walks. Our systems admit efficient key-validation techniques that yield CCA-secure encryp-tion, thus providing an important step towards efficient post-quantum non-interactive key exchange (NIKE).
dc.language.isoen
dc.publisherSpringer, Cham
dc.source.titleLecture Notes in Computer Science
dc.subject.enkey exchange
dc.subject.enelliptic curves
dc.subject.enisogenies
dc.subject.enpost-quantum cryptography
dc.title.enTowards practical key exchange from ordinary isogeny graphs
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-030-03332-3_14
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
dc.subject.halMathématiques [math]/Théorie des nombres [math.NT]
dc.identifier.arxiv1809.07543
bordeaux.volumevol 11274
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleASIACRYPT 2018 - 24th Annual International Conference on the Theory and Application of Cryptology and Information Security
bordeaux.countryAU
bordeaux.title.proceedingLecture Notes in Computer Science
bordeaux.conference.cityBrisbane
bordeaux.peerReviewedoui
hal.identifierhal-01872817
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2018-12-06
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01872817v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Lecture%20Notes%20in%20Computer%20Science&rft.volume=vol%2011274&rft.au=DE%20FEO,%20Luca&KIEFFER,%20Jean&SMITH,%20Benjamin&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