DES Ciphering Algorithm

Abstract

The main goal of this work is the implementation of cryptanalysis of DES and a statistical and theoretical analysis of its complexity and success probability. In order to achieve this goal, we implement first a very fast DES routine, resulting in a speed increase of almost 50 % towards the best known classical implementation. The experimental results suggest strongly that the attack is in average about 10 times faster as expected with plaintext-ciphertext at disposal; furthermore, we have achieved a complexity of by using only known pairs. Last, we propose a new analytical expression which approximates success probabilities; it gives slightly better results