Statistical Cryptanalysis on MIBS as a Lightweight Algorithm

Please enable javascript in your browser.

Beheshtifard, Saeed | 2014

661 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 45783 (05)
University: Sharif University of Technology
Department: Electrical Engineering
Advisor(s): Salmasizadeh, Mahmud; Mohajeri, Javad
Abstract:
In RFIDtags application or sensor network for some hardware constraints we can not use all-purpose crypto systems such as AES,DES.In this applications in trade off between security and efficiency considering inherent limitation،we desire to satisfy moderate level of security.In recent years various lightweight algorithm has been designed.Purpose of this thesis is cryptanalysis on MIBS as a lightweight algorithm.This lightweight block cipher with Feistel structure and data length of 64-bit uses key lengths of 64-bit or 80-bit and consists of 32 rounds.Methods of attacks are differential،impossible differential and differential fault.the results of differential and impossible differential attack did not improve compared to previous references results.But in this thesis for the first time differential fault analysis is applied on this cryptosystem.The best result is when we have two fault nibbles with uniform distribution for their positions,then 64key bit recovery complexity will be 2^39.31that has considerable improvement than exhaustive search 2^64
Keywords:
Impossible Differential Cryptanalysis ; Lightweight Algorithms ; Differential Cryptoanalysis ; Differential Fault Attack

No TOC