Dworak Kamil, Boryczka Urszula
Faculty of Science and Technology, University of Silesia in Katowice, Będzińska 39, 41-200 Sosnowiec, Poland.
Entropy (Basel). 2021 Dec 18;23(12):1697. doi: 10.3390/e23121697.
This article presents the author's own metaheuristic cryptanalytic attack based on the use of differential cryptanalysis (DC) methods and memetic algorithms (MA) that improve the local search process through simulated annealing (SA). The suggested attack will be verified on a set of ciphertexts generated with the well-known DES (data encryption standard) reduced to six rounds. The aim of the attack is to guess the last encryption subkey, for each of the two characteristics Ω. Knowing the last subkey, it is possible to recreate the complete encryption key and thus decrypt the cryptogram. The suggested approach makes it possible to automatically reject solutions (keys) that represent the worst fitness function, owing to which we are able to significantly reduce the attack search space. The memetic algorithm (MASA) created in such a way will be compared with other metaheuristic techniques suggested in literature, in particular, with the genetic algorithm (NGA) and the classical differential cryptanalysis attack, in terms of consumption of memory and time needed to guess the key. The article also investigated the entropy of MASA and NGA attacks.
本文介绍了作者基于差分密码分析（DC）方法和通过模拟退火（SA）改进局部搜索过程的文化算法（MA）所提出的元启发式密码分析攻击。所建议的攻击将在使用简化为六轮的著名数据加密标准（DES）生成的一组密文上进行验证。攻击的目的是针对两个特征Ω中的每一个猜测最后一个加密子密钥。知道最后一个子密钥后，就有可能重建完整的加密密钥，从而解密密文。所建议的方法能够自动拒绝代表最差适应度函数的解决方案（密钥），因此我们能够显著减少攻击的搜索空间。以这种方式创建的文化算法（MASA）将在内存消耗和猜测密钥所需的时间方面与文献中提出的其他元启发式技术进行比较，特别是与遗传算法（NGA）和经典差分密码分析攻击进行比较。本文还研究了MASA和NGA攻击的熵。
