Ciphertext-only fault analysis of GIFT lightweight cryptosystem  

作　　者：Wei LI Shan CAO Dawu GU Jiayao LI Tianpei CAI Menglin WANG Li SUN Zhiqiang LIU Ya LIU 

机构地区：[1]School of Computer Science and Technology,Donghua University,Shanghai 201620,China [2]Department of Computer Science and Engineering,Shanghai Jiao Tong University,Shanghai 200240,China [3]Shanghai Key Laboratory of Computing and Systems,Shanghai Jiao Tong University,Shanghai 200240,China [4]Shanghai Key Laboratory of Integrate Administration Technologies for Information Security,Shanghai Jiao Tong University,Shanghai 200240,China [5]Department of Computer Science and Engineering,University of Shanghai for Science and Technology,Shanghai 200093,China

出　　处：《Science China(Information Sciences)》2022年第3期259-261,共3页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China (Grant Nos. 61772129, 61672347);National Cryptography Development Fund (Grant Nos. MMJJ20180101, MMJJ20180202);Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Key Laboratory of Integrated Administration Technologies for Information Security (Grant No. AGK201703);Shanghai Sailing Program (Grant No. 17YF1405500);Graduate Student Innovation Fund of Donghua University (Grant No. GSIF-DH-M-2019013)。

摘　　要：Dear editor,The GIFT cryptosystem was proposed by Banik et al. [1]in CHES 2017. It can be widely applied to protect RFID tags and other low-resource devices. It has an SPN structure with a fixed 128-bit key size and two flexible variants of 64-bit and 128-bit block sizes. In simulations, GIFT achieves good performance and surpasses both SIMON and SKINNY [1]. In 2013, Fuhr et al. [2] proposed a ciphertextonly fault analysis(CFA) of AES for three types of faults:zero-byte fault, zero-nibble fault.

关 键 词：EDITOR fault RFID 

分 类 号：TN918.1[电子电信—通信与信息系统]