Square Always Exponentiation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Square Always Exponentiation

Christophe Clavier
DMI
Benoit Feix
  • Function : Author
  • PersonId : 883791
DMI
Georges Gagnerot
  • Function : Author
  • PersonId : 918159
DMI
Mylène Roussellet
  • Function : Author
  • PersonId : 883792

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.
Fichier principal
Vignette du fichier
square_always.pdf (402.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00633545 , version 1 (18-10-2011)

Identifiers

Cite

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. pp.40-57, ⟨10.1007/978-3-642-25578-6_5⟩. ⟨inria-00633545⟩
338 View
3090 Download

Altmetric

Share

Gmail Facebook X LinkedIn More