Paper 2019/008
One Fault is All it Needs: Breaking Higher-Order Masking with Persistent Fault Analysis
Jingyu Pan, Shivam Bhasin, 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.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- fault attacksmaskingpersistent
- Contact author(s)
- sbhasin @ ntu edu sg
- History
- 2019-01-09: received
- Short URL
- https://ia.cr/2019/008
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/008,
author = {Jingyu Pan and Shivam Bhasin and Fan Zhang and Kui Ren},
title = {One Fault is All it Needs: Breaking Higher-Order Masking with Persistent Fault Analysis},
howpublished = {Cryptology ePrint Archive, Paper 2019/008},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/008}},
url = {https://eprint.iacr.org/2019/008}
}
