Infective Computation and Dummy Rounds: Fault Protection for Block Ciphers without Check-before-Output

Gierlichs Benedikt, Jorn-Marc Schmidt, Mike Tunstall

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

42 Citations (Scopus)

Abstract

Implementation attacks pose a serious threat for the security of cryptographic devices and there are a multitude of countermeasures that are used to prevent them. Two countermeasures used in implementations of block ciphers to increase the complexity of such attacks are the use of dummy rounds and redundant computation with consistency checks to prevent fault attacks. In this paper we present several countermeasures based on the idea of infective computation. Our countermeasures ensure that a fault injected into a cipher, dummy, or redundant round will infect the ciphertext such that an attacker cannot derive any information on the secret key being used. This has one clear advantage: the propagation of faults prevents an attacker from being able to conduct any fault analysis on any corrupted ciphertexts. As a consequence, there is no need for any test at the end of an implementation to determine if a fault has been injected and a ciphertext can always be returned.
Original languageEnglish
Title of host publicationLATINCRYPT 2012
PublisherSpringer Berlin Heidelberg
Pages305-321
Volume7533
Publication statusPublished - 2012

Fingerprint Dive into the research topics of 'Infective Computation and Dummy Rounds: Fault Protection for Block Ciphers without Check-before-Output'. Together they form a unique fingerprint.

Cite this