SPA on MIST Exponentiation Algorithm with Multiple Computational SequencesReport as inadecuate

SPA on MIST Exponentiation Algorithm with Multiple Computational Sequences - Download this document for free, or read online. Document in PDF available to download.

1 Physical Analysis & Cryptographic Engineering PACE Singapore 2 LCIS - Laboratory of Cryptography and Information Security

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.

Keywords : division chain exponentiation MIST algorithm side-channel analysis simple power analysis

Author: Chien-Ning Chen - Jheng-Hong Tu - Sung-Ming Yen -



Related documents