Página 1 dos resultados de 1 itens digitais encontrados em 0.011 segundos

Genetic algorithms in cryptography; GAs in cryptography

Delman, Bethany
Fonte: Rochester Instituto de Tecnologia Publicador: Rochester Instituto de Tecnologia
Tipo: Tese de Doutorado Formato: 539124 bytes; 1220359 bytes; 1220123 bytes; 1003907 bytes; 19284 bytes; 537 bytes; 539 bytes; 1727 bytes; 19168 bytes; 19630 bytes; 19149 bytes; 21868 bytes; 21147 bytes; 23856 bytes; 31031 bytes; 6479 bytes; 6943 bytes; 20517 bytes; 5083 bytes; 6691 byte
Relevância na Pesquisa
Genetic algorithms (GAs) are a class of optimization algorithms. GAs attempt to solve problems through modeling a simplified version of genetic processes. There are many problems for which a GA approach is useful. It is, however, undetermined if cryptanalysis is such a problem. Therefore, this work explores the use of GAs in cryptography. Both traditional cryptanalysis and GA-based methods are implemented in software. The results are then compared using the metrics of elapsed time and percentage of successful decryptions. A determination is made for each cipher under consideration as to the validity of the GA-based approaches found in the literature. In general, these GA-based approaches are typical of the field. Of the genetic algorithm attacks found in the literature, totaling twelve, seven were re-implemented. Of these seven, only three achieved any success. The successful attacks were those on the transposition and permutation ciphers by Matthews [20], Clark [4], and Gr¨undlingh and Van Vuuren [13], respectively. These attacks were further investigated in an attempt to improve or extend their success. Unfortunately, this attempt was unsuccessful, as was the attempt to apply the Clark [4] attack to the monoalphabetic substitution cipher and achieve the same or indeed any level of success. Overall...