Cryptology ePrint Archive: Report 2009/119
A Continuous Fault Countermeasure for AES Providing a Constant Error Detection Rate
Abstract: Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. However, for symmetric algorithms like AES, the main focus of available countermeasures lies on performance so that their achieved error detection rates are rather low or not determinable at all. Even worse, those error detection rates only apply to specific parts of the cipher. In this paper we present a way to achieve a constantly higher error detection rate throughout the whole algorithm while assuming a much stronger adversary model than in previous papers. Furthermore, we propose solutions for two very important, unsolved questions: First, how to do secure and efficient table lookups in redundant algebras. Second, how to implement secure correctness checks to verify the result in a scenario where the adversary can manipulate comparisons. Our paper is therefore the first one to construct a sound and continuous AES fault countermeasure with an attacker-independent minimum error detection rate.
Category / Keywords: implementation / Fault attacks, countermeasure, AES, EAN+B codes, redundant table lookups, secure correctness checks.
Date: received 12 Mar 2009
Contact author: marcel medwed at iaik tugraz at
Available format(s): PDF | BibTeX Citation
Version: 20090315:020844 (All versions of this report)
Short URL: ia.cr/2009/119
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]