Identificação de chaves e Algoritmos Criptográficos utilizando Algoritmos Genéticos e Teoria dos Grafos.
(Identification of Keys and Cryptographic Algorithms Using Genetic Algorithm and Graph Theory.)
José Xexéo (firstname.lastname@example.org)2, William Souza (email@example.com)1, Renato Torres (firstname.lastname@example.org)2, Gláucio Oliveira (email@example.com)2, Ricardo Linden (Rlinden@cepel.br)3
1Universidade Federal do Rio de Janeiro (UFRJ)2Instituto Militar de Engenharia (IME)3Faculdade Salesiana Maria Auxiliadora (FSMA)
This paper appears in: Revista IEEE América Latina
Publication Date: April 2011
Volume: 9, Issue: 2
This paper describes genetic algorithms that use the Calisnki-Harabasz index as its evaluation function and graphs techniques that are both used to identify patterns in cryptograms generated by cryptographics algorithms certified by NIST (National Institute Standard Technology), namely AES, RC6, MARS, Twofish and Serpent. Evidence of patterns or “signatures” generated by the algorithms under test were detected, thus corroborating the results of other studies quoted here. The results obtained with these two techniques are compared with results reported in [CARVALHO, 2006] and [SOUZA,2006], showing superiority in the accuracy of class generation.
Clustering, Block Ciphers, Algorithms Genetics, Graphs.
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (494)]