On selection of modulus of quadratic codes for the protection of cryptographic operations against fault attacks

Warning The system is temporarily closed to updates for reporting purpose.

Yumbul, Kazım and Erdem, Serdar Süer and Savaş, Erkay (2014) On selection of modulus of quadratic codes for the protection of cryptographic operations against fault attacks. IEEE Transactions on Computers, 63 (5). pp. 1182-1196. ISSN 0018-9340 (Print) 1557-9956 (Online)

This is the latest version of this item.

[thumbnail of 06313592.pdf] PDF
06313592.pdf
Restricted to Registered users only

Download (3MB) | Request a copy

Abstract

Quadratic residue codes are introduced as an effective and efficient fault detection technique to protect cryptographic devices against fault attacks. In this paper, we re-consider these codes in an adversarial model, where a powerful attacker can introduce faults with high precision and accuracy. We present two analysis techniques that can lead to successful attacks against quadratic codes if the modulus is not chosen carefully.Weprovide in-depth theoretical analysis that covers wide range of attacks and present results of practical concerns such as exact number of undetected faults and effective countermeasures. Our analysis is generic in the sense that it can be extended to other residue codes.
Item Type: Article
Uncontrolled Keywords: Security, cryptographic algorithms, fault attacks, fault detection
Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Erkay Savaş
Date Deposited: 20 Dec 2014 11:39
Last Modified: 02 Aug 2019 12:10
URI: https://research.sabanciuniv.edu/id/eprint/25175

Available Versions of this Item

Actions (login required)

View Item
View Item