Automatic characterization of exploitable faults : a machine learning approach

Characterizing the fault space of a cipher to filter out a set of faults potentially exploitable for fault attacks (FA), is a problem with immense practical value. A quantitative knowledge of the exploitable fault space is desirable in several applications, like security evaluation, cipher construct...

Full description

Saved in:
Bibliographic Details
Main Authors: Dasgupta, Pallab, Saha, Sayandeep, Jap, Dirmanto, Patranabis, Sikhar, Mukhopadhyay, Debdeep, Bhasin, Shivam
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2019
Subjects:
Online Access:https://hdl.handle.net/10356/104642
http://hdl.handle.net/10220/48070
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-104642
record_format dspace
spelling sg-ntu-dr.10356-1046422020-09-26T22:19:29Z Automatic characterization of exploitable faults : a machine learning approach Dasgupta, Pallab Saha, Sayandeep Jap, Dirmanto Patranabis, Sikhar Mukhopadhyay, Debdeep Bhasin, Shivam School of Physical and Mathematical Sciences Physical Analysis & Cryptographic Engineering (PACE) Labs Temasek Laboratories DRNTU::Engineering::Electrical and electronic engineering Security Block Cipher Characterizing the fault space of a cipher to filter out a set of faults potentially exploitable for fault attacks (FA), is a problem with immense practical value. A quantitative knowledge of the exploitable fault space is desirable in several applications, like security evaluation, cipher construction and implementation, design, and testing of countermeasures etc. In this work, we investigate this problem in the context of block ciphers. The formidable size of the fault space of a block cipher mandates the use of an automation strategy to solve this problem, which should be able to characterize each individual fault instance quickly. On the other hand, the automation strategy is expected to be applicable to most of the block cipher constructions. Existing techniques for automated fault attacks do not satisfy both of these goals simultaneously and hence are not directly applicable in the context of exploitable fault characterization. In this paper, we present a supervised machine learning (ML) assisted automated framework, which successfully addresses both of the criteria mentioned. The key idea is to extrapolate the knowledge of some existing FAs on a cipher to rapidly figure out new attack instances. Experimental validation of this idea on two state-of-the-art block ciphers – PRESENT and LED, establishes that our approach is able to provide fairly good accuracy in identifying exploitable fault instances at a reasonable cost. Utilizing this observation, we propose a statistical framework for exploitable fault space characterization, which can provide an estimate of the success rate of an attacker corresponding to a given fault model and fault location. The framework also returns test vectors leading towards successful attacks. As a potential application, the effect of different S-Boxes on the fault space of a cipher is evaluated utilizing the framework. Accepted version 2019-04-25T09:18:38Z 2019-12-06T21:36:46Z 2019-04-25T09:18:38Z 2019-12-06T21:36:46Z 2019 2019 Journal Article Saha, S., Jap, D., Patranabis, S., Mukhopadhyay, D., Bhasin, S., & Dasgupta, P. (2019). Automatic characterization of exploitable faults : a machine learning approach. IEEE Transactions on Information Forensics and Security, 14(4), 954-968. doi:10.1109/TIFS.2018.2868245 1556-6013 https://hdl.handle.net/10356/104642 http://hdl.handle.net/10220/48070 10.1109/TIFS.2018.2868245 212667 en IEEE Transactions on Information Forensics and Security © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TIFS.2018.2868245 14 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering
Security
Block Cipher
spellingShingle DRNTU::Engineering::Electrical and electronic engineering
Security
Block Cipher
Dasgupta, Pallab
Saha, Sayandeep
Jap, Dirmanto
Patranabis, Sikhar
Mukhopadhyay, Debdeep
Bhasin, Shivam
Automatic characterization of exploitable faults : a machine learning approach
description Characterizing the fault space of a cipher to filter out a set of faults potentially exploitable for fault attacks (FA), is a problem with immense practical value. A quantitative knowledge of the exploitable fault space is desirable in several applications, like security evaluation, cipher construction and implementation, design, and testing of countermeasures etc. In this work, we investigate this problem in the context of block ciphers. The formidable size of the fault space of a block cipher mandates the use of an automation strategy to solve this problem, which should be able to characterize each individual fault instance quickly. On the other hand, the automation strategy is expected to be applicable to most of the block cipher constructions. Existing techniques for automated fault attacks do not satisfy both of these goals simultaneously and hence are not directly applicable in the context of exploitable fault characterization. In this paper, we present a supervised machine learning (ML) assisted automated framework, which successfully addresses both of the criteria mentioned. The key idea is to extrapolate the knowledge of some existing FAs on a cipher to rapidly figure out new attack instances. Experimental validation of this idea on two state-of-the-art block ciphers – PRESENT and LED, establishes that our approach is able to provide fairly good accuracy in identifying exploitable fault instances at a reasonable cost. Utilizing this observation, we propose a statistical framework for exploitable fault space characterization, which can provide an estimate of the success rate of an attacker corresponding to a given fault model and fault location. The framework also returns test vectors leading towards successful attacks. As a potential application, the effect of different S-Boxes on the fault space of a cipher is evaluated utilizing the framework.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Dasgupta, Pallab
Saha, Sayandeep
Jap, Dirmanto
Patranabis, Sikhar
Mukhopadhyay, Debdeep
Bhasin, Shivam
format Article
author Dasgupta, Pallab
Saha, Sayandeep
Jap, Dirmanto
Patranabis, Sikhar
Mukhopadhyay, Debdeep
Bhasin, Shivam
author_sort Dasgupta, Pallab
title Automatic characterization of exploitable faults : a machine learning approach
title_short Automatic characterization of exploitable faults : a machine learning approach
title_full Automatic characterization of exploitable faults : a machine learning approach
title_fullStr Automatic characterization of exploitable faults : a machine learning approach
title_full_unstemmed Automatic characterization of exploitable faults : a machine learning approach
title_sort automatic characterization of exploitable faults : a machine learning approach
publishDate 2019
url https://hdl.handle.net/10356/104642
http://hdl.handle.net/10220/48070
_version_ 1681059211851595776