Abstract
TWINE cipher is a generalized Feistel structure algorithm, which can be applied to Internet of things terminals with limited computing resources because of its good performance. Since it was proposed, it has been widely studied by academia and industry. This paper analyses the permutation law of TWINE cipher, and proposes a differential fault attack method with its differential property. By selecting 33th,34th and 35th rounds for the nibble differential fault attack, the original 80-bit key can be recovered from 24 nibble fault ciphertext, with the computational complexity and data complexity of 210.47 and 210.58, respectively. The results show this method has great advantages over other public literatures about the cryptanalysis of TWINE cipher.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
