New Power Analysis on the Ha-Moon Algorithm and the MIST Algorithm

Sim, Sang Gyoo; Park, Dong Jin; Lee, Pil Joong

doi:10.1007/978-3-540-30191-2_23

Cited by 5 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The original purpose of the algorithms of [5,9] has been to provide protection against differential side-channel attacks by randomly changing the BSD representation of the secret key of elliptic curve cryptosystems. Subsequent work [4,11] has however shown that randomly changing the BSD representation of the secret key alone is not sufficient.…”

mentioning

confidence: 96%

On binary signed digit representations of integers

Ebeid

Hasan

2006

Des Codes Crypt

View full text Add to dashboard Cite

Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several binary signed digit (BSD) representations and their number depends on its value and varies with its length. In this paper, we present an algorithm that calculates the exact number of BSD representations of an integer of a certain length. We formulate the integer that has the maximum number of BSD representations among all integers of the same length. We also present an algorithm to generate a random BSD representation for an integer starting from the most significant end and its modified version which generates all possible BSD representations. We show how the number of BSD representations of k increases as we prepend 0s to its binary representation.

show abstract

mentioning

confidence: 96%

On binary signed digit representations of integers

Ebeid

Hasan

2006

Des Codes Crypt

View full text Add to dashboard Cite

show abstract

“…However, the improved Ha-Moon algorithm has a weakness similar to the original Ha-Moon algorithm in that there are a few possible intermediate values [1,6]. After processing (k…”

Section: Weakness Of the Improved Ha-moon Algorithmmentioning

confidence: 99%

DPA Attack on the Improved Ha-Moon Algorithm

Shin

Park

Lee

2006

Information Security Applications

Self Cite

View full text Add to dashboard Cite

The algorithm proposed by Ha and Moon [2] is a countermeasure against power analysis. The Ha-Moon algorithm has two drawbacks in that it requires an inversion and has a right-to-left approach. Recently, Yen, Chen, Moon and Ha improved the algorithm by removing these drawbacks [7]. Their new algorithm is inversion-free, has a left-toright approach and employs a window method. They insisted that their algorithm leads to a more secure countermeasure in computing modular exponentiation against side-channel attacks. This algorithm, however, still has a similar weakness observed in [1, 6]. This paper shows that the improved Ha-Moon algorithm is vulnerable to differential power analysis even if we employ their method in selecting si.

show abstract

“…Besides the analysis by Walter, Oswald pointed out the security margin provided in [6] is wrong (might be lower) [8]. Sim et al [9] also analyzed the MIST algorithm with an additional assumption which is similar to the doubling attack [7]. This paper presents a multi-sequence SPA on the MIST algorithm.…”

Section: Introductionmentioning

confidence: 99%

SPA on MIST Exponentiation Algorithm with Multiple Computational Sequences

Chen

Yen

2013

Security Engineering and Intelligence Informatics

View full text Add to dashboard Cite

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 squaremultiply sequences. Further countermeasures such as exponent blinding are required to prevent the analysis proposed in this paper.

show abstract

New Power Analysis on the Ha-Moon Algorithm and the MIST Algorithm

Cited by 5 publications

References 22 publications

On binary signed digit representations of integers

On binary signed digit representations of integers

DPA Attack on the Improved Ha-Moon Algorithm

SPA on MIST Exponentiation Algorithm with Multiple Computational Sequences

Contact Info

Product

Resources

About