Volume 2, Issue 2 (November 2007)
IJMSI 2007, 2(2): 45-56 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
M. ABADI, B. SADEGHIAN, A. GHAEMI, M. A. ALIPOUR. FINDING HIGHLY PROBABLE DIFFERENTIAL CHARACTERISTICS OF SUBSTITUTION-PERMUTATION NETWORKS USING GENETIC ALGORITHMS. IJMSI 2007; 2 (2) :45-56
URL: http://ijmsi.ir/article-1-24-en.html
URL: http://ijmsi.ir/article-1-24-en.html
Abstract:
In this paper, we propose a genetic algorithm, called GenSPN, for finding highly probable differential characteristics of substitution permutation networks (SPNs). A special fitness function and a heuristic mutation operator have been used to improve the overall performance of the algorithm. We report our results of applying GenSPN for finding highly probable differential characteristics of Serpent block cipher. A comparison of the resultant characteristics with the previously published works shows that GenSPN can find differential characteristics of higher probabilities.
Keywords: DIFFERENTIAL CHARACTERISTIC, DIFFERENTIAL CRYPTANALYSIS, GENETIC ALGORITHMS, SUBSTITUTION, PERMUTATION NETWORK, SERPENT
Type of Study: Research paper |
Subject:
General
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
