Square Always Exponentiation

Abstract : 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.
Type de document :
Communication dans un congrès
12th International Conference on Cryptology in India - INDOCRYPT 2011, Dec 2011, Chennai, India. Springer, 7107, pp.40-57, 2011, LNCS. 〈10.1007/978-3-642-25578-6_5〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00633545
Contributeur : Vincent Verneuil <>
Soumis le : mardi 18 octobre 2011 - 17:00:32
Dernière modification le : jeudi 11 janvier 2018 - 06:26:18
Document(s) archivé(s) le : jeudi 19 janvier 2012 - 02:30:51

Fichier

square_always.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Christophe Clavier, Benoit Feix, Georges Gagnerot, Mylène Roussellet, Vincent Verneuil. Square Always Exponentiation. 12th International Conference on Cryptology in India - INDOCRYPT 2011, Dec 2011, Chennai, India. Springer, 7107, pp.40-57, 2011, LNCS. 〈10.1007/978-3-642-25578-6_5〉. 〈inria-00633545〉

Partager

Métriques

Consultations de la notice

612

Téléchargements de fichiers

1220