سال انتشار: ۱۳۸۶

محل انتشار: چهارمین کنفرانس انجمن رمز ایران

تعداد صفحات: ۸

نویسنده(ها):

Alireza Shafieinejad – Dept. of Electrical and Computer Engineering Isfahan University of Technology, IRAN
Faramarz Hendessi – Dept. of Electrical and Computer Engineering Isfahan University of Technology, IRAN
Niloofar Azmi – Dept. of Electrical and Computer Engineering Isfahan University of Technology, IRAN
Bahareh Kazemi – Azad Islamic University

چکیده:

FDE is a block cipher which has a SP network structure with easy software and hardware implementations. FDE Randomness evaluation by stochastic tests, were presented in previous works. In this article we try to show FDE has a good security margin against various attacks. Specially, Differential and Linear attacks are considered and it’s shown that FDE has a provable security structure. We’ve found that lower bound of Differential is 2114. Moreover, in linear cryptanalysis we show that the linear probability is less than 2-59 which requires at least 2118 plain-cipher text that is greater than all of pairs.