Square Always Exponentiation
VERNEUIL, Vincent
Inside Secure
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
< Réduire
Inside Secure
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Langue
en
Communication dans un congrès
Ce document a été publié dans
12th International Conference on Cryptology in India - INDOCRYPT 2011, 2011-12-11, Chennai. 2011-12, vol. 7107, p. 40-57
Springer
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Mots clés en anglais
Public key cryptography
exponentiation
long integer arithmetic
side-channel analysis
atomicity
Origine
Importé de halUnités de recherche