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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00633545
Contributor : Vincent Verneuil <>
Submitted on : Tuesday, October 18, 2011 - 5:00:32 PM
Last modification on : Thursday, January 11, 2018 - 6:26:18 AM
Long-term archiving on: Thursday, January 19, 2012 - 2:30:51 AM

File

square_always.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

665

Files downloads

1972