Recent cryptosystems constitute an effective task for cryptanalysis algorithms due to their internal structure based on nonlinearity. This problem can be formulated as NP-Hard. It has long been subject to various attacks; available results, emerged many years ago remain insufficient when handling large instances due to resources requirement which increase with the amount of processed data. On another side, optimization techniques inspired by swarm intelligence represents a set of approaches used to solve complex problems. This is mainly due to their fast convergence with a consumption of reduced resources. The purpose of this paper is to provide, and for a first time, a more detailed study about the performance of BAT algorithm in cryptanalysis of some variant of Data encryption standard algorithms. Experiments were performed to study the effectiveness of the used algorithm in solving the considered problem and underline the difficulties encountered.
Birincil Dil | İngilizce |
---|---|
Bölüm | Research Article |
Yazarlar | |
Yayımlanma Tarihi | 1 Nisan 2015 |
Yayımlandığı Sayı | Yıl 2015 Cilt: 3 Sayı: 2 |