Cryptology ePrint Archive: Report 2019/008

One Fault is All it Needs: Breaking Higher-Order Masking with Persistent Fault Analysis

Jingyu Pan and Shivam Bhasin and Fan Zhang and Kui Ren

Abstract: Persistent fault analysis (PFA) was proposed at CHES 2018 as a novel fault analysis technique. It was shown to completely defeat standard redundancy based countermeasure against fault analysis. In this work, we investigate the security of masking schemes against PFA. We show that with only one fault injection, masking countermeasures can be broken at any masking order. The study is performed on publicly available implementations of masking.

Category / Keywords: implementation / fault attacks, masking, persistent

Date: received 3 Jan 2019

Contact author: sbhasin at ntu edu sg

Available format(s): PDF | BibTeX Citation

Version: 20190109:004230 (All versions of this report)

Short URL: ia.cr/2019/008


[ Cryptology ePrint archive ]