스프레드 랜덤 인터리버 방법에 기반을 둔 효율적인 DES 알고리즘

Abstract

Due to the fact that the initial and final permutation tables are opened to users, the conventional DES algorithm has some difficulty in its application in the personal cloud computing environment to provide security. In this thesis, we propose an advanced DES algorithm(I-DES algorithm) that is based on the spread random interleaver method. The main idea of the proposed algorithm is to employ a permutation table generated by a spread random interleaver instead of the fixed permutation table to improve privacy further. Our simulation results reveal that the proposed I-DES algorithm is superior to the 3DES and legacy DES algorithms in the aspects of encryption speed and security guarantee. The proposed algorithm is also applicable to variable-length plain data block adapting the CBC(Cipher Block Chaining) method in the environment of the personal cloud computing.