In this paper, we study GF-NLFSR, a Generalized Unbalanced Feistel Network (GUFN) which can be considered as an extension of the outer function FO of the KASUMI block cipher. We show that the differential and linear probabilities of any n + 1 rounds of an n-cell GF-NLFSR are both bounded by p, where the corresponding probability of the round function is p. Besides analyzing security against dif...

the six-degree equations of flight in their classic form do not provide a proper physical perception due to a number of interferences. nor do they render visible the important role of attack angles. in this study, attempts have been made to develop a complete set of 3d acceleration equations from the equations of normal and tangential acceleration αn=vωv, αt=v ̇. for this purpose, a coordinate s...

This paper presents a linear cryptanalytic attack against the SAFER family of block ciphers. Linear cryptanalysis is a statistical well-known-plaintext attack that explores (approximate) linear relations between plaintext, ciphertext and subkey bits. These linear relations apply only to certain key classes. The results show that by considering nonhomomorphic linear relations, more rounds of the...

recently, baghery et al. [1, 2] presented some attacks on two rfid protocols, namely yoon and jung et al. protocols, and proposed the improved version of them. however, in this note, we show that the improved version of the jung et al. protocol suffers from desynchronization attack and the improved version of the yoon's protocol suffers from secret disclosure attack. the success probabilit...

NLS is a stream cipher consisting of a non-linear feedback shift register (NFSR) and a non-linear filter (NLF). This paper presents a linear distinguishing attack on NLS using an improved version of the Crossword Puzzle (CP) attack [2] by exploiting the internal dependencies between the NFSR and NLF. We derive significantly higher bias linear approximations of the NFSR and NLF using linear comb...

It has been considered most important and difficult to analyze the bias and find a large bias regarding the security of cryptosystems, since the invention of linear cryptanalysis. The demonstration of a large bias will usually imply that the target crypto-system is not strong. Regarding the bias analysis, researchers often focus on a theoretical solution for a specific problem. In this paper, w...

Zero-correlation linear attack is a new method for cryptanalysis of block ciphers developed by Bogdanov et al. in 2012. In this paper we adapt the matrix method to find zerocorrelation linear approximations. Then we present several zero-correlation linear approximations for 14 rounds of LBlock and describe a cryptanalysis for 22 rounds of the reduced LBlock. After biclique attacks on LBlock rev...

We show that the linear cryptanalytic attack on RC5 that was published by Kaliski and Yin at Crypto’95 does not work as expected due to the failure of some hidden assumptions involved. Then we present new linear attacks on RC5. Our attacks use the same linear approximation as the one used by Kaliski and Yin. Therefore, the plaintext requirement of our attack is around 4w2r−2 which is impractica...

Three attacks on the DES with a reduced number of rounds in the Cipher Feedback Mode (CFB) are studied, namely a meet in the middle attack, a diierential attack, and a linear attack. These attacks are based on the same principles as the corresponding attacks on the ECB mode. They are compared to the three basic attacks on the CFB mode, namely an exhaustive key search, a comparison attack, and a...