Side-Channel Vulnerabilities of Unified Point Addition on Binary Huff Curve and Its Countermeasure

Cho, Sung Min; Jin, Sunghyun; Kim, Hee Seok

doi:10.3390/app8102002

Cited by 5 publications

(18 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result, the version 2 is used for the hardware implementations in [10], [21]- [23]. Recently, the work in [25] has evaluated version 2 from the security point of view and pointed out some new vulnerabilities (attack methods) on BHC. Moreover, in order to provide the security against the highlighted attack methods, the authors in [25] have constructed new formulations for the unified PA law of BHC.…”

Section: B Research Gapmentioning

confidence: 99%

“…Recently, the work in [25] has evaluated version 2 from the security point of view and pointed out some new vulnerabilities (attack methods) on BHC. Moreover, in order to provide the security against the highlighted attack methods, the authors in [25] have constructed new formulations for the unified PA law of BHC. The new formulations for unified BHC law in [25] are termed as version 3 in this article.…”

Section: B Research Gapmentioning

confidence: 99%

“…Moreover, in order to provide the security against the highlighted attack methods, the authors in [25] have constructed new formulations for the unified PA law of BHC. The new formulations for unified BHC law in [25] are termed as version 3 in this article. The brief description of unified PA laws for BHC over GF (2 m ) in version 1, version 2 and version 3 are provided in Section II-A.…”

Section: B Research Gapmentioning

confidence: 99%

See 2 more Smart Citations

An Optimized Architecture for Binary Huff Curves With Improved Security

et al. 2021

View full text Add to dashboard Cite

In order to compute the elliptic curve point addition and doubling, the unified point addition law provides better protection against side channel attacks. One of the elliptic curve models, providing the unified point addition, is Binary Huff Curves (BHC). Recently, a new unified method for BHC with improved security against side channel attacks, has been proposed. Therefore, an optimized hardware architecture in terms of higher clock frequency and throughput for the new unified point addition method is required. Consequently, this article has three major contributions: The first contribution is to modify the unified addition law from hardware implementation point of view, resulting 31% decrease in memory requirements. The second contribution is the analysis of memory optimized unified law in the context of pipelining. In this regard, this article proposes an instruction scheduling policy for a 2-stage pipelined architecture which provides 36% reduction in the number of required clock cycles, 14.3% improvement in clock frequency, 53.2% decrease in computation time and 54.5% improvement in throughput/area. Finally, the third contribution is to propose a 4-stage pipelined architecture. The proposed 4-stage pipelined architecture provides an additional 19% improvement in clock frequency and 10% increase in throughput, as compared to the 2-stage pipelined architecture.

show abstract

Section: B Research Gapmentioning

confidence: 99%

Section: B Research Gapmentioning

confidence: 99%

Section: B Research Gapmentioning

confidence: 99%

See 1 more Smart Citation

An Optimized Architecture for Binary Huff Curves With Improved Security

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Thereafter, practical results of an improved HCCA exploiting collisions of multiple LIMs in scalar multiplication targeting a 384-bit implementation on a 64-bit architecture is published by Danger et al [17]. Practical experimental results of HCCA and ROSETTA on specific elliptic curves are presented in the works of Das et al [18] and Cho et al [19] targeting 192-bit and 256-bit implementations, respectively.…”

Section: Introductionmentioning

confidence: 99%

A Combined Single Trace Attack on Global Shuffling Long Integer Multiplication and its Novel Countermeasure

Lee

Cho²,

Kim

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Advanced collision-based single trace attacks which can be applied on simple power analysis resistant scalar multiplications become virtual threat on elliptic curve cryptosystems recently as their practical experimental results are increasingly reported in the literature. Since such attacks are based on detecting collisions of data dependent leakage caused by underlying long integer multiplications, so-called global shuffling countermeasure which breaks such collision correlation by independently randomizing the execution order of unit operations such as single precision multiplication and carry propagation, is considered as promising countermeasure if theoretical randomness of shuffling order is guaranteed. In this paper, we firstly analyze the practical security of the global shuffling long integer multiplications by exhibiting a combined single trace attack on software implementations on an ARM Cortex-M4 microcontroller. Our combined attack consists of a simple power analysis for revealing random permutation vectors which enables later collision-based single trace attack. First we demonstrate how to reveal random permutation vectors for carry propagation process of whole global shuffling long integer multiplications within a single power trace by simple power analysis accompanied with straightforward substitution of power consumption samples. Then we perform collision-based single trace attacks after rearranging the order of subtraces for unit carry propagations based on revealed permutation vectors. Since the vulnerability to simple power analysis is originated from the if-statement for selection of proper entries of the permutation vectors, we propose a novel countermeasure which eliminates such selection with simple addition and modulus operation and also demonstrate practical result achieving regularity in power trace patterns. INDEX TERMS Cryptography, digital signatures, elliptic curves, public key, side-channel attacks.

show abstract

“…The thirteen papers in this special issue can be classified into the following four research themes:Power analysis attacks and counter-measures: This special issue contains various power analysis attacks and counter-measures on well-known crypto algorithms: Elliptic curve cryptosystems (ECCs), the block cipher SEED, and the post-quantum cryptographies (PQCs). A new side channel leakage of the SEED in financial IC cards in the Republic of Korea was detected in [61]; and new vulnerabilities, using a single power consumption trace obtained in the elliptic curve scalar multiplication algorithm, were established in [62,63]. Recently, PQCs, cryptographic algorithms executed on a classical computer which are expected to be secure against adversaries with quantum computers, have been actively studied.…”

mentioning

confidence: 99%