High-order timing attacks

  • Authors:
  • Jean-Luc Danger;Nicolas Debande;Sylvain Guilley;Youssef Souissi

  • Affiliations:
  • TELECOM-ParisTech and Secure-IC S.A.S.;TELECOM-ParisTech and MORPHO and SERMA;TELECOM-ParisTech and Secure-IC S.A.S.;TELECOM-ParisTech and Secure-IC S.A.S.

  • Venue:
  • Proceedings of the First Workshop on Cryptography and Security in Computing Systems
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

The timing attack (TA) is a side-channel analysis (SCA) variant that exploits information leakage through the computation duration. Previously, leakages in timing have been exploited by comparison analysis, most often thanks to "correlation - collision" or pre-characterization on a clone device. Time bias can also be used to break a secret crypto-system by linear correlations in a non-profiled setting. There is direct parallel between the Correlation Power Attack (CPA) and TA, the distinguisher being the same, but the exploited data being either vertical or horizontal. The countermeasures against such attacks consist in making the algorithm run in either random or constant time. In this paper, we show that the former is prone to high-order attacks that analyse the higher moments of the time computation during code execution. We present successful second-order timing attacks (2O-TA) based on a correlation and compare it to the second-order power attack. All experiments have been conducted on an 8-bit processor running an AES-128.