An Approach of Zero Correlation Linear Cryptanalysis
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2016, Vol 7, Issue 5
Abstract
Differential and Linear Cryptanalysis are two most popular techniques that have been widely used to attacks block ciphers to reveal its weakness in substitution and permutation network. Most of the block ciphers which are resistant against Differential and Linear Cryptanalysis may not be immune to their latest extensions such as Impossible Differential Cryptanalysis (IDC) and Zero Correlation Linear Cryptanalysis (ZCLC). These techniques use the statistics of distinguishing the correct key and incorrect key from probability distribution of impossible differentials and linear approximation respectively. Most of IDC and ZCLC are based on miss in middle technique and are independent of non linear components. In this paper, the method used by ZCLC is explained and the block ciphers which have been attacked by ZCLC and multidimensional ZCLC have been stated. The links between IDC and ZCLC have been also projected.
Authors and Affiliations
Mehak Khurana , Meena Kumari
Keywords
Related Articles
- EP ID EP123321
- DOI -
- Views 131
- Downloads 0
Transition Bandwidth Analysis of Infinite Impulse Response Filters
Infinite impulse response (IIR) is a property applying to many linear time-invariant systems. Digital filters are the common example of linear time invariant systems. Systems with this property are called IIR systems or...
Novel Approach for Detection of Brain Tumor using Segmentation Techniques
Medical Image Processing is one of the standard method to detect the abnormal tissue. The key benefit of this field is reduction of manual work and early detection of the disease. Various types of medical imaging modalit...
Cosine Similarity Function For The Temporal Dynamic Web Data
Cosine similarity function is one of the most popular similarity function for handling the web data in various applications such as recommender system, collaborative filtering algorithms, classification algorithms, etc....
An Efficient Approach to Minimize Data Collection Delay in Wireless Sensor Networks
Data assortment latency might become higher attributable to the comparatively slow travel speed of mobile components . Thus , the planning of mobile components , i.e. , however they traverse through the sensing field and...
Modelling and Performance Analysis of Personalized DSR Routing Protocol to discover a selfish and Inimical Node in MANETs Using NS-2
In this paper we activated the default dynamic source routing protocol with a selfish and inimical node and compared the performance of this code with default dynamic source routing protocol. The performance of this code...