چكيده به لاتين
In this study, we investigate the WhiteBox cryptography, which is a new and innovative method in cryptography that adversary has full access to our implementation. The aim of WhiteBox cryptography is to design and modify cryptography algorithms such that they could be resistant in environment that there exists WhiteBox attacker. These kind of techniques was first introduced by Stanley Chew et al. in 2002. They proposed a WhiteBox version of AES-128, But two years later in 2004 Billet et al. proposed an algebric attack(BGE) on their algorithm and after fourteen years many researchers are still trying to introduce an algorithm to be strength enough vs WhiteBox attack. We believe that the solution is behind the understanding of this fact that what really the meaning of full access is, and how much powerful the WhiteBox attacker is, and also the details of AES algorithms could play an essential role to solve the problem. Instead of complicating the algorithm, we focus on the point in which the adversary extracts the cryptography's key by adding extra components to it.We claim if we replace the XOR operation with another one, the extraction of keyround would be more difficult or the extracted data is not applicable for decryption of plain text.
Keywords: WhiteBox Cryptography, Full Access,Keyround,Side Channel, Tamper
