The paper presents several improved side channel cube attacks on PRESENT based on single bit leakage model. Compared with the previous study of Yang et al in CANS 2009 [30], based on the same model of single bit leakage in the 3 round, we show that: if the PRESENT cipher structure is unknown, for the leakage bit 0, 32-bit key can be recovered within 2 chosen plaintexts; if the cipher structure ...

The concrete of numerous buildings and structures is at increased risk due to various kinds aggressive pollutants. In this regard, it necessary implement take additional actions, among which the so-called technological methods for structure property modification are promising. These comprise improvement modernization existing technologies produce most effective building before introduction stee...

The cube attack is a powerful cryptanalysis technique against symmetric primitives, especially for stream ciphers. One of the key step in recovering superpoly. division property has been introduced to attacks with aim first identify variables/monomials that are not involved Recently, some improved versions this allowing recovery exact superpoly have developed and applied on various ciphers [13,...

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...

Today the transmission of multimedia data including image and video is growing in telecommunications. Security is one of the main issues in transferring such sensitive information. Powerful image encryption algorithm is the solution for this problem. This paper is an implementation of a color image encryption algorithm based on Rubik’s cube technique. The Rubik’s cube technique is used for pixe...

Dinur and Shamir have described cube attacks at EUROCRYPT ’09 and they have shown how efficient they are on the stream cipher Trivium up to 767 rounds. These attacks have been extended to distinguishers but since this seminal work, no better results on the complexity of key recovery attacks on Trivium have been presented. It appears that the time complexity to compute cubes is expensive and the...

Time-memory-data (TMD) trade-off attack is a wellstudied technique that has been applied on many stream and block ciphers. Current TMD attacks by Biryukov-Shamir (BSTMD), Hong-Sarkar (HS-TMD) and Dunkelman-Keller (DKTMD) has been applied to ciphers like Grain-v1 and AES-192/256 modes of operation to break them with online complexity faster than exhaustive search. However, there is still a limit...