Efficient Persistent Fault Analysis with Small Number of Chosen Plaintexts
In 2018, Zhang et al. introduced the Persistent Fault Analysis (PFA) for the first time, which uses statistical features of ciphertexts caused by faulty Sbox to recover the key of block ciphers. However, for most of the variants of PFA, the prior knowledge of the fault (location and value) is requi...
Main Authors: | Fan Zhang, Run Huang, Tianxiang Feng, Xue Gong, Yulong Tao, Kui Ren, Xinjie Zhao, Shize Guo |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2023-03-01
|
Series: | Transactions on Cryptographic Hardware and Embedded Systems |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/10292 |
Similar Items
-
Persistent Fault Analysis Against SM4 Implementations in Libraries Crypto++ and GMSSL
by: Qing Guo, et al.
Published: (2021-01-01) -
Research on a Random Mask Infection Countermeasure against Double Fault Attacks
by: Weixiang Wu, et al.
Published: (2023-11-01) -
Novel Fault Injection Attack without Artificial Trigger
by: HanSeop Lim, et al.
Published: (2020-06-01) -
Instruction-Fetching Attack and Practice in Collision Fault Attack on AES
by: Huilong Jiang, et al.
Published: (2022-10-01) -
FaultMeter: Quantitative Fault Attack Assessment of Block Cipher Software
by: Keerthi K, et al.
Published: (2023-03-01)