Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis

نویسندگان

  • Amr M. Youssef
  • Stafford E. Tavares
چکیده

In this letter, we study the marginal density of the XOR distribution table, and the linear approximation table entries of regular substitution boxes (s-boxes). Based on this, we show that the fraction of good s-boxes (with regard to immunity against linear and differential cryptanalysis) increases dramatically with the number of input variables. Introduction Differential cryptanalysis [1], and linear cryptanalysis [3] are currently the most powerful cryptanalytic attacks on private-key block ciphers. The complexity of differential cryptanalysis depends on the size of the largest entry in the XOR table, the total number of zeroes in the XOR table, and the number of nonzero entries

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Review of Existing 4-bit Crypto S-box cryptanalysis Techniques and Two New Techniques with 4-bit Boolean Functions for Cryptanalysis of 4-bit Crypto S-boxes

4-bit Linear Relations play an important role in Cryptanalysis of 4-bit Bijective Crypto S-boxes. 4-bit finite differences also a major part of cryptanalysis of 4-bit substitution boxes. Count of existence of all 4-bit linear relations, for all of 16 input and 16 output 4-bit bit patterns of 4-bit bijective crypto S-boxes said as S-boxes has been reported in Linear Cryptanalysis of 4-bit S-boxe...

متن کامل

Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis

Linear cryptanalysis and diierential cryptanalysis are two recently introduced, powerful methodologies for attacking private-key block ciphers. In this paper, we examine the application of these two cryptanalysis techniques to a CAST-like encryption algorithm based on randomly generated s-boxes. It is shown that, when randomly generated substitution boxes (s-boxes) are used in a CAST-like algor...

متن کامل

On the Number Of Nonlinear Regular S-boxes

A. M. Youssef and S. E. Tavares Department Of Electrical and Computer Engineering Queen’s University Kingston, Ontario, Canada, K7L 3N6 Phone : (613) 545–2945 Fax : (613) 545–6615 email : [email protected] Indexing terms: Cryptography, Private-key cryptosystems, Substitution boxes, Combinatorics. Abstract Nonlinearity is a crucial requirement for the substitution boxes in secure block ciphe...

متن کامل

"Provable" Security against Differential and Linear Cryptanalysis

In this invited talk, a brief survey on the developments of countermeasures against differential and linear cryptanalysis methods is presented. 1 Nonlinearity of S-boxes Throughout the eighties the unpublished design criteria of the DES had inspired various authors to invent formal nonlinearity criteria for S-boxes such as the strict avalanche criterion [30] and the propagation criterion [27]. ...

متن کامل

Towards the optimality of Feistel ciphers with substitution-permutation functions

We explore the optimality of balanced Feistel ciphers with SP-type Ffunctions with respect to their resistance against differential and linear cryptanalysis. Instantiations of Feistel ciphers with the wide class of (SP) and (SP)S F-functions are considered: One F-function can contain an arbitrary number of S-box layers interleaved with linear diffusion. For the matrices with maximum diffusion, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 56  شماره 

صفحات  -

تاریخ انتشار 1995