Skip to Main content Skip to Navigation
Conference papers

SPA on MIST Exponentiation Algorithm with Multiple Computational Sequences

Abstract : The MIST algorithm is a randomized version of the division chain exponentiation algorithm and is a side-channel countermeasure. When analyzing the MIST algorithm by ordinary simple power analysis (with only one square-multiply sequence obtained), an attacker cannot retrieve the secret exponent due to the ambiguous relationship between the square-multiply sequence and the computation. We point out the MIST algorithm is still vulnerable to simple power analysis observing multiple power consumption traces and propose a practical method with detailed steps to deduce the secret exponent from multiple square-multiply sequences. Further countermeasures such as exponent blinding are required to prevent the analysis proposed in this paper.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01506557
Contributor : Hal Ifip <>
Submitted on : Wednesday, April 12, 2017 - 10:24:54 AM
Last modification on : Thursday, March 5, 2020 - 4:47:26 PM
Long-term archiving on: : Thursday, July 13, 2017 - 12:32:30 PM

File

978-3-642-40588-4_16_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

  • HAL Id : hal-01506557, version 1

Citation

Chien-Ning Chen, Jheng-Hong Tu, Sung-Ming Yen. SPA on MIST Exponentiation Algorithm with Multiple Computational Sequences. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. pp.222-235. ⟨hal-01506557⟩

Share

Metrics

Record views

135

Files downloads

284