Cube Attacks On PRINCE And PRESENT

With the rapid development of the Internet of Things, lightweight cryptographic algorithms attract more attention. Many new lightweight block cipher were proposed, such as PRINCE algorithm, PRESENT algorithm and so on. The lightweight block cipher algorithm analysis plays an essential role in promoting the development of cryptanalysis. Cube attack is a new way of attack which was proposed in recent years. This thesis attacks the two lightweight cryptographic algorithms- PRINCE and PRESENT by Cube attack and gets the following results:(1) Based on the diffusion structure analysis and the idea of divide and conquer algorithm, we have exhaust search all Cube items for 2 round PRINCE. 210.658 chosen plaintext can recover 48 bit key. Considering side channel attack, we attack 2 round PRINCE by the Cube attack based on Hamming weight. The attack can recover all 64-bit key and needs 211.8517 chosen plaintext. Finally, the distributions Cube item for 2 round PRINCE algorithm are further studied based on three models.(2) 1000 Cube items for 3 round PRESENT can be searched within 20 minutes, and the Cube attack for 3 round PRESENT can recover 32-bit seed key with 27.13 chosen plaintext, which is the lower than what is known. It is first proposed that the Cube attack for 5 round PRESENT Cube attack based on Cube distinguisher. We regard Cube items for 3 round PRESENT as distinguisher and based on coding theory, then we can recover one correct key value between guess key. The attack can recover 32-bit seed key and needs 28.39 chosen plaintext and 229.39 computation complexity.