A secure white‐box SM4 implementation. Issue 10 (16th December 2015)

• Record Type: Journal Article
• Authors: Bai, Kunpeng; Wu, Chuankun
• Is Part Of: Security and communication networks. Volume 9:Issue 10(2016)
• Page Start: 996
• Page End: 1006
• Publication Date: 2015-12-16
• Subjects: white‐box cryptography -- SM4 -- secure implementation -- lookup tables -- obfuscation; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1394
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract: White‐box cryptography aims at implementing a cipher to protect its key from being extracted in a white‐box attack context, where an attacker has full control over dynamic execution of the cryptographic software. So far, most white‐box implementations exploit lookup‐table‐based techniques and have been broken because of a weakness that the embedded large linear encodings are cancelled out by compositions of lookup tables. In this paper, we propose a new lookup‐table‐based white‐box implementation for the Chinese block cipher standard SM4 that can protect the large linear encodings from being cancelled out. Our implementation, which can resist a series of white‐box attacks, requires 32.5MB of memory to store the lookup tables and is about nine times as fast as the previous Xiao–Lai white‐box SM4 implementation. Copyright © 2015 John Wiley & Sons, Ltd. Abstract : This paper presents a new lookup‐table‐based white‐box implementation for the Chinese block cipher standard SM4, which can resist a series of white‐box attacks. It requires 32.5 MB of memory to store the lookup tables and is about nine times as fast as the previous Xiao–Lai white‐box SM4 implementation.