دوره 2، شماره 2 - ( 8-1386 )                   جلد 2 شماره 2 صفحات 45-56 | برگشت به فهرست نسخه ها


XML Print


Download citation:
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-fa.html
FINDING HIGHLY PROBABLE DIFFERENTIAL CHARACTERISTICS OF SUBSTITUTION-PERMUTATION NETWORKS USING GENETIC ALGORITHMS. مجله علوم ریاضی و انفورماتیک ایرانیان. 1386; 2 (2) :45-56

URL: http://ijmsi.ir/article-1-24-fa.html


چکیده:  

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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه علوم ریاضی و انفورماتیک می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2018 All Rights Reserved | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb