Implementing cryptographic pairings at standard security levels
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | ENGE, Andreas | |
| hal.structure.identifier | KoDe Software | |
| dc.contributor.author | MILAN, Jérôme | |
| dc.contributor.editor | Rajat Subhra Chakraborty | |
| dc.contributor.editor | Vashek Matyas | |
| dc.contributor.editor | Patrick Schaumont | |
| dc.date.accessioned | 2024-04-04T03:21:17Z | |
| dc.date.available | 2024-04-04T03:21:17Z | |
| dc.date.created | 2014 | |
| dc.date.conference | 2014-10-18 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194645 | |
| dc.description.abstractEn | This study reports on an implementation of cryptographic pairings in a general purpose computer algebra system. For security levels equivalent to the different AES flavours, we exhibit suitable curves in parametric families and show that optimal ate and twisted ate pairings exist and can be efficiently evaluated. We provide a correct description of Miller's algorithm for signed binary expansions such as the NAF and extend a recent variant due to Boxall et al. to addition-subtraction chains. We analyse and compare several algorithms proposed in the literature for the final exponentiation. Finally, we give recommendations on which curve and pairing to choose at each security level. | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.subject.en | pairings | |
| dc.subject.en | implementation | |
| dc.subject.en | elliptic curve cryptology | |
| dc.title.en | Implementing cryptographic pairings at standard security levels | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-319-12060-7_3 | |
| dc.subject.hal | Mathématiques [math]/Théorie des nombres [math.NT] | |
| dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
| dc.subject.hal | Informatique [cs]/Logiciel mathématique [cs.MS] | |
| dc.identifier.arxiv | 1407.5953 | |
| dc.description.sponsorshipEurope | Algorithmic Number Theory in Computer Science | |
| bordeaux.page | 28-46 | |
| bordeaux.volume | 8804 | |
| 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 | Security, Privacy, and Applied Cryptography Engineering | |
| bordeaux.country | IN | |
| bordeaux.conference.city | Pune | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01034213 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2014-10-22 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01034213v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.volume=8804&rft.spage=28-46&rft.epage=28-46&rft.au=ENGE,%20Andreas&MILAN,%20J%C3%A9r%C3%B4me&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||