Subspace trail cryptanalysis is a very recent new cryptanalysis technique, and includes differential, truncated differential, impossible differential, and integral attacks as special cases. In this paper, we consider PRINCE, a widely analyzed block cipher proposed in 2012. After the identification of a 2.5 rounds subspace trail of PRINCE, we present several (truncated differential) attacks up t...

Automated search methods based on Satisfiability Modulo Theory (SMT) problems are being widely used to evaluate the security of block ciphers against distinguishing attacks. While these provide a systematic and generic methodology, most their software implementations limited small set attacks, extending requires significant effort expertise. In this work, authors present cryptographic algorithm...

Through in-depth study of the 4-round encryption characteristics of advanced encryption standard (AES), a new 4-round differential path with a probability of existence at 2 -30 has been derived. Based on this path, a novel method was proposed for impossible differential cryptanalysis of 8-round AES-256. The analysis method requires 2 95 pairs of chosen plaintexts, approximately 2 163 units of m...

The overall structure is one of the most important properties of block ciphers. At present, the most common structures include Feistel structure, SP structure, MISTY structure, L-M structure and Generalized Feistel structure. In [29], Choy et al. proposed a new structure called GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register), and designed a new block cipher called Four-Cell whi...

In this paper presents the Linear Cryptanalysis on S-DES and Symmetric Block Ciphers Using Hill Cipher Method. As a vehicle of demonstration of this concept, choose simple yet representative block ciphers such as computationally tractable versions of S-DES, for the studies. The attack presented in this paper is applicable to block structure independently of the key scheduling. The attack needs ...

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

In this paper, we propose a systematic method for finding impossible differentials for block cipher structures, better than the Umethod introduced by Kim et al [4]. It is referred as a unified impossible differential finding method (UID-method). We apply the UID-method to some popular block ciphers such as Gen-Skipjack, Gen-CAST256, GenMARS, Gen-RC6, Four-Cell, SMS4 and give the detailed imposs...

In this paper, we investigate the impossible differential properties of the underlying block cipher and compression function of the new cryptographic hashing standard of the Russian federation Streebog. Our differential trail is constructed in such a way that allows us to recover the key of the underlying block cipher by observing input and output pairs of the compression function which utilize...

At CRYPTO’16, Beierle et al. presented SKINNY, a family of lightweight tweakable block ciphers intended to compete with SIMON. SKINNY can be implemented efficiently in both softand hardware, possesses a SubstitutionPermutation-Network structure, and supports block sizes of 64 and 128 bits as well as key and tweak sizes of 64, 128, 192, and 256 bits. This paper outlines a related-tweakey impossi...

This report describes impossible differential (ID) attacks on 3.75round SAFER SK-64, using 2 chosen texts, 2 memory, and 2 time. Moreover, an ID attack on both 2.75-round SAFER+ and on 2.75-round SAFER++ uses 2 data, 2 memory, and 2 time. We used the miss-in-the-middle technique developed by Biham et al. These attacks do not endanger the security of SAFER ciphers, and indicate that ID attacks w...