Bitwise-Xor of two 4 bit binary numbers or 4-bit bit patterns entitled 4-bit differences carries information in Cryptography. The Method to Analyze Cryptographic cipher algorithms or 4-bit substitution boxes with 4-bit differences is known as Differential Cryptanalysis. In this paper a brief review of Differential Cryptanalysis of 4-bit bijective Crypto S-Boxes and a new algorithm to analyze th...

Related-cipher attack was introduced by Hongjun Wu in 2002 [25]. We can consider related ciphers as block ciphers with the same round function but different number of rounds. This attack can be applied to related ciphers by using the fact that their key schedules do not depend on the total number of rounds. In this paper we introduce differential related-cipher attack on block ciphers, which co...

Differential and linear cryptanalysis are two of the most powerful techniques to analyze symmetric-key primitives. For modern ciphers, resistance against these attacks is therefore a mandatory design criterion. In this paper, we propose a novel technique to prove security bounds against both differential and linear cryptanalysis. We use mixedinteger linear programming (MILP), a method that is f...

Impossible differential cryptanalysis is one of the cryptanalysis methods that are applicable to the new Advanced Encryption Standard (AES). In this paper, we present an introduction to the method by applying it on Mini-AES, the mini version of the AES published in Cryptologia recently.

Impossible differential is a useful method for cryptanalysis. SIMON is a light weight block cipher that has attracted lots of attention ever since its publication in 2013. In this paper we propose impossible differential attack on five versions of SIMON, using bit conditions to minimize key bits guessed. We calculate keybits and give the exact attack results.

We answer a question of Paterson, showing that all block systems for the group generated by the round functions of a key-alternating block cipher are the translates of a linear subspace. Following up remarks of Paterson and Shamir, we exhibit a connection to truncated differential cryptanalysis. We also give a condition that guarantees that the group generated by the round functions of a key-al...

Since its introduction, impossible differential cryptanalysis has been applied to many ciphers. Besides the specific application of the technique in various instances, there are some very basic results which apply to generic structures of ciphers, e.g., the well known 5-round impossible differential of Feistel ciphers with bijective round functions. In this paper we present a new approach for t...

Currently, the Republic of Kazakhstan is developing a new standard for symmetric data encryption. One candidates role Qamal encryption algorithm developed by Institute Information and Computer Technologies (Almaty, Kazakhstan). The article describes algorithm. Differential properties main operations that make up cypher are considered in questions stability. We have shown version with 128-bit bl...

in this paper, we show how to obtain suitable differential charactristics for block ciphers with neural networks. we represent the operations of a block cipher, regarding their differential characteristics, through a directed weighted graph. in this way, the problem of finding the best differential characteristic for a block cipher reduces to the problem of finding the minimum-weight multi-path...