Square Always Exponentiation
| hal.structure.identifier | DMI | |
| dc.contributor.author | CLAVIER, Christophe | |
| hal.structure.identifier | DMI | |
| dc.contributor.author | FEIX, Benoit | |
| hal.structure.identifier | DMI | |
| dc.contributor.author | GAGNEROT, Georges | |
| hal.structure.identifier | Inside Secure | |
| dc.contributor.author | ROUSSELLET, Mylène | |
| hal.structure.identifier | Inside Secure | |
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | VERNEUIL, Vincent | |
| dc.date.accessioned | 2024-04-04T02:26:33Z | |
| dc.date.available | 2024-04-04T02:26:33Z | |
| dc.date.issued | 2011-12 | |
| dc.date.conference | 2011-12-11 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/189957 | |
| dc.description.abstractEn | Embedded exponentiation techniques have become a key concern for security and efficiency in hardware devices using public key cryptography. An exponentiation is basically a sequence of multiplications and squarings, but this sequence may reveal exponent bits to an attacker on an unprotected implementation. Although this subject has been covered for years, we present in this paper new exponentiation algorithms based on trading multiplications for squarings. Our method circumvents attacks aimed at distinguishing squarings from multiplications at a lower cost than previous techniques. Last but not least, we present new algorithms using two parallel squaring blocks which provide the fastest exponentiation to our knowledge. | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.subject.en | Public key cryptography | |
| dc.subject.en | exponentiation | |
| dc.subject.en | long integer arithmetic | |
| dc.subject.en | side-channel analysis | |
| dc.subject.en | atomicity | |
| dc.title.en | Square Always Exponentiation | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-642-25578-6_5 | |
| dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
| bordeaux.page | 40-57 | |
| bordeaux.volume | 7107 | |
| 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 | 12th International Conference on Cryptology in India - INDOCRYPT 2011 | |
| bordeaux.country | IN | |
| bordeaux.conference.city | Chennai | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | inria-00633545 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2011-12-14 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00633545v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2011-12&rft.volume=7107&rft.spage=40-57&rft.epage=40-57&rft.au=CLAVIER,%20Christophe&FEIX,%20Benoit&GAGNEROT,%20Georges&ROUSSELLET,%20Myl%C3%A8ne&VERNEUIL,%20Vincent&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||