Research on disturbing white‐box cryptography algorithm based on local differential privacy

Abstract

AbstractWhite‐box cryptography protects the secret key extraction from software implementations of cryptographic primitives. The principle is to white‐box the key by using obfuscation and hide the key in the whole encryption process to ensure that the key cannot be traced and extracted. The idea of adding internal perturbed terms and additional random equations is given by Bringer et al. to implement white‐box encryption, which has been attacked due to the defect in structure. In this paper, we propose a new secure white‐box encryption method by combining the random perturbation mechanism of local differential privacy protection and adding internal interference term, which can protect the privacy of the intermediate secret key more securely. The further disrupted cipher can also obtain the correct result by voting without increasing the number of parallel systems, and also gives the practical white‐box representation to AEw/oS. Compared with the white‐box implementation proposed by Bringer et al., the memory space of the new white‐box scheme will be 44 bytes more, but in terms of security, it can resist traditional attacks and Mulder's attacks.