Download PDFOpen PDF in browser

Automatic Generation of HCCA Resistant Scalar Multiplication Algorithm by Proper Sequencing of Field Multiplier Operands

17 pagesPublished: October 4, 2017

Abstract

Horizontal collision correlation analysis (HCCA) imposes a serious threat to
simple power analysis resistant elliptic curve cryptosystems involving unified algorithms, for e.g. Edward curve unified formula. This attack can be mounted even in presence of differential power analysis resistant randomization schemes. In this paper we have designed an effective countermeasure for HCCA protection, where the dependency of side-channel leakage from a school-book multiplication with the underling multiplier operands is investigated. We have shown how changing the sequence in which the operands are passed to the multiplication algorithm introduces dissimilarity in the information leakage. This disparity has been utilized in constructing a zero-cost countermeasure against HCCA. This countermeasure has been shown to help in HCCA resistivity. Additionally we provide experimental validation for our proposed countermeasure technique on a SASEBO platform. To the best of our knowledge, this is the first time that asymmetry in information leakage has been utilized in designing a side channel countermeasure and successfully applied in an ECC-based crypto-module.

Keyphrases: asymmetric leakage, countermeasure, ECC, field multiplications, HCCA

In: Ulrich Kühne, Jean-Luc Danger and Sylvain Guilley (editors). PROOFS 2017. 6th International Workshop on Security Proofs for Embedded Systems, vol 49, pages 33--49

Links:
BibTeX entry
@inproceedings{PROOFS2017:Automatic_Generation_of_HCCA,
  author    = {Poulami Das and Debapriya Basu Roy and Debdeep Mukhopadhyay},
  title     = {Automatic Generation of HCCA Resistant Scalar Multiplication Algorithm by Proper Sequencing of Field Multiplier Operands},
  booktitle = {PROOFS 2017. 6th International Workshop on Security Proofs for Embedded Systems},
  editor    = {Ulrich K\textbackslash{}"uhne and Jean-Luc Danger and Sylvain Guilley},
  series    = {EPiC Series in Computing},
  volume    = {49},
  pages     = {33--49},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/PQdH},
  doi       = {10.29007/qszz}}

The requested page was not found on this server.

Download PDFOpen PDF in browser