SSFA: Subset fault analysis of ASCON-128 authenticated cipher

Abstract

Present-day IoT systems that capture, process, and transfer real-world data, employ lightweight ciphers in sensor devices for applications with multiple limitations, such as restricted size, power consumption, and processing speed. The largest security threat that such devices incur comprises implementation-based attacks, such as fault attacks, power analysis attacks, etc. Therefore, it is imperative to perform a meticulous security evaluation of lightweight ciphers against such implementation attacks. This paper aims at evaluating the security of ASCON against fault analysis attacks. ASCON is an authenticated cipher, the CAESAR competition winner under lightweight use case portfolio, in February 2019. The use of 128-bit random nonce as part of the input state makes the cipher resistant against classical cryptanalysis techniques such as differential cryptanalysis, linear cryptanalysis, and variants. However, the key whitening operation with the finalization stage's output to produce the tag T (a publicly available value) creates an attack path for an adversary. Based on this vulnerability, we propose a key recovery attack called Preliminary attack, in which we discuss three methods to mount the proposed Preliminary attack. Furthermore, the S-box used in ASCON possesses a component function with zero correlation immunity that renders it vulnerable against subset cryptanalysis. We propose a novel key recovery attack: Subset fault analysis (SSFA) attack that exploits the vulnerable S-box. Both the proposed attacks can be mounted with different granularities and can uniquely determine the key of full-round ASCON. We also discuss some probable countermeasures to throttle the proposed attacks. Particularly, we recommend an S-box mapping that is resistant to the proposed attack. The recommended S-box preserves all other essential cryptographic properties of the original S-box used in ASCON.