Evolutionary Computation in Cryptanalysis of Classical Ciphers
نویسندگان
چکیده
منابع مشابه
Classical Ciphers and Cryptanalysis
Cryptography is the study of transmitting secret messages securely from one party to another. To accomplish this task, the original text, called plaintext, is “translated” into an encrypted version, called ciphertext, which is sent to the intended recipient. The recipient decrypts the text to obtain the original message. Cryptanalysis is process of analyzing the “hidden” message to learn inform...
متن کاملApplying evolutionary computation methods for the cryptanalysis of Feistel ciphers
In this contribution instances of a problem introduced by the differential cryptanalysis of Feistel cryptosystems are formulated as optimization tasks. The performance of Evolutionary Computation methods on these tasks is studied for a representative Feistel cryptosystem, the Data Encryption Standard. The results indicate that the proposed methodology is efficient in handling this type of probl...
متن کاملAutomated Cryptanalysis of Classical Ciphers
Classical ciphers are used to encrypt plaintext messages written in a natural language in such a way that they are readable for sender or intended recipient only. Many classical ciphers can be broken by brute-force search through the key-space. Methods of artificial intelligence, such as optimization heuristics, can be used to narrow the search space, to speed-up text processing and text recogn...
متن کاملCryptanalysis of SDES via evolutionary computation techniques
The cryptanalysis of simplified data encryption standard can be formulated as NP-Hard combinatorial problem. The goal of this paper is two fold. First we want to make a study about how evolutionary computation techniques can efficiently solve the NP-Hard combinatorial problem. For achieving this goal we test several evolutionary computation techniques like memetic algorithm, genetic algorithm a...
متن کاملEvolutionary Computation Algorithms for Cryptanalysis: A Study
The cryptanalysis of various cipher problems can be formulated as NP-Hard combinatorial problem. Solving such problems requires time and/or memory requirement which increases with the size of the problem. Techniques for solving combinatorial problems fall into two broad groups – exact algorithms and Evolutionary Computation algorithms. An exact algorithms guarantees that the optimal solution to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tatra Mountains Mathematical Publications
سال: 2017
ISSN: 1210-3195
DOI: 10.1515/tmmp-2017-0026