Clustering versus Statistical Analysis for SCA: when Machine Learning is Better

  title={Clustering versus Statistical Analysis for SCA: when Machine Learning is Better},
  author={Marcin Aftowicz and Ievgen Kabin and Zoya Dyka and Peter Langend{\"o}rfer},
  journal={2021 10th Mediterranean Conference on Embedded Computing (MECO)},
Evaluation of the resistance of implemented cryptographic algorithms against SCA attacks, as well as detecting of SCA leakage sources at an early stage of the design process, is important for an efficient re-design of the implementation. Thus, effective SCA methods that do not depend on the key processed in the cryptographic operations are beneficially and can be a part of the efficient design methodology for implementing cryptographic approaches. In this work we compare two different methods… 

Figures and Tables from this paper



Horizontal Attacks using K-Means: Comparison with Traditional Analysis Methods

The result was that even though counter intuitive approaches such as the Pearson correlation coefficient outperform k-means, these approaches are not an ideal candidate to improve side channel analysis attacks as the core feature if these attacks is to reveal the correlation between measurement values and the key bits processed.

Horizontal address-bit DPA against montgomery kP implementation

This paper details the horizontal Address-Bit DPA attack against a Montgomery kP implementation and applied the attack against the ECDSA-algorithm and revealed the private key used to generate a digital signature with a correctness of 100%.

Methods increasing inherent resistance of ECC designs against horizontal attacks

Address-Bit Differential Power Analysis of Cryptographic Schemes OK-ECDH and OK-ECDSA

This paper proposes an alternative DPA using the addresses of registers of elliptic curve based cryptosystems (ECC) implemented on smart cards that works against scalar exponentiations even if the implementation is resistant against the data-based DPA.

Least squares quantization in PCM

The corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy.

Software Implementation of Elliptic Curve Cryptography over Binary Fields

This paper presents an extensive and careful study of the software implementation on workstations of the NIST-recommended elliptic curves over binary fields. We also present the results of our