Towards practical key exchange from ordinary isogeny graphs
| hal.structure.identifier | Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX] | |
| hal.structure.identifier | Laboratoire de Mathématiques de Versailles [LMV] | |
| dc.contributor.author | DE FEO, Luca | |
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | École normale supérieure - Paris [ENS-PSL] | |
| dc.contributor.author | KIEFFER, Jean | |
| hal.structure.identifier | Geometry, arithmetic, algorithms, codes and encryption [GRACE] | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | SMITH, Benjamin | |
| dc.date.accessioned | 2024-04-04T03:05:14Z | |
| dc.date.available | 2024-04-04T03:05:14Z | |
| dc.date.conference | 2018-12-02 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/193226 | |
| dc.description.abstractEn | We 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.iso | en | |
| dc.publisher | Springer, Cham | |
| dc.source.title | Lecture Notes in Computer Science | |
| dc.subject.en | key exchange | |
| dc.subject.en | elliptic curves | |
| dc.subject.en | isogenies | |
| dc.subject.en | post-quantum cryptography | |
| dc.title.en | Towards practical key exchange from ordinary isogeny graphs | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-030-03332-3_14 | |
| dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
| dc.subject.hal | Mathématiques [math]/Théorie des nombres [math.NT] | |
| dc.identifier.arxiv | 1809.07543 | |
| bordeaux.volume | vol 11274 | |
| 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 2018 - 24th Annual International Conference on the Theory and Application of Cryptology and Information Security | |
| bordeaux.country | AU | |
| bordeaux.title.proceeding | Lecture Notes in Computer Science | |
| bordeaux.conference.city | Brisbane | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01872817 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2018-12-06 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01872817v1 | |
| bordeaux.COinS | ctx_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 |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||