Efficient Leak Resistant Modular Exponentiation in RNS
| Autor: | Thomas Plantard, Christophe Negre, Andrea Lesavourey |
|---|---|
| Přispěvatelé: | Digits, Architectures et Logiciels Informatiques (DALI), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Université de Perpignan Via Domitia (UPVD), University of Wollongong [Australia] |
| Rok vydání: | 2017 |
| Předmět: |
Modular exponentiation
Leak Exponentiation Computation 02 engineering and technology Parallel computing 020202 computer hardware & architecture Loop (topology) [MATH.MATH-LO]Mathematics [math]/Logic [math.LO] 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Side channel attack Hardware_ARITHMETICANDLOGICSTRUCTURES Arithmetic Mathematics |
| Zdroj: | ARITH 24th Symposium on Computer Arithmetic ARITH: Computer Arithmetic ARITH: Computer Arithmetic, Jul 2017, London, United Kingdom. pp.156-163, ⟨10.1109/ARITH.2017.39⟩ |
| Popis: | International audience; The leak resistant arithmetic in RNS was introduced in 2004 to randomize RSA modular exponentiation. This randomization is meant to protect implementations on embedded device from side channel analysis. We propose in this paper a faster version of the approach of Bajard et al. in the case of right-to-left square-and-multiply exponentiation. We show that this saves roughly 30% of the computation when the randomization is done at each loop iteration. We also show that the level of randomization of the proposed approach is better than the one of Bajard et al. after a few number of loop iterations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|