Beyond the Limits of DPA: Combined Side-Channel Collision Attacks

The problem of extracting the highest possible amount of key-related information using the lowest possible number of measurements is one of the central questions in side-channel attacks against embedded implementations of cryptographic algorithms. To address it, this work proposes a novel framework...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 61; číslo 8; s. 1153 - 1164
Hlavní autoři: Bogdanov, A., Kizhvatov, I.
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.08.2012
Témata:
AES
Algorithm design and analysis
Analysis of algorithms and problem complexity
collision attacks
Computational complexity
cryptographic implementations
Cryptography
data encryption
Data mining
Equations
Euclidean distance
physical security
side-channel analysis
ISSN:0018-9340
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The problem of extracting the highest possible amount of key-related information using the lowest possible number of measurements is one of the central questions in side-channel attacks against embedded implementations of cryptographic algorithms. To address it, this work proposes a novel framework enhancing side-channel collision attacks with divide-and-conquer attacks such as differential power analysis (DPA). An information-theoretical metric is introduced for the evaluation of collision detection efficiency. Improved methods of dimension reduction for side-channel traces are developed based on a statistical model of euclidean distance. Experimental results confirm that DPA-combined collision attacks are superior to both DPA-only and collision-only attacks. The new methods of dimension reduction lead to further complexity improvements. All attacks are treated for the case of AES-128 and are practically validated on a widespread 8-bit RISC microcontroller.
ISSN:0018-9340
DOI:10.1109/TC.2011.140