By Topic

Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei-guo Zhang ; ISN Lab., Xidian Univ., Xi'an, China ; Pasalic, E.

In this paper, a novel approach of finding disjoint linear codes is presented. The cardinality of a set of [u, m, t+1] disjoint linear codes largely exceeds all the previous best known methods used for the same purpose. Using such sets of disjoint linear codes, not necessarily of the same length, we have been able to provide a construction technique of t-resilient S-boxes F:F2n→2m ( n even, ) with strictly almost optimal nonlinearity . This is the first time that the bound 2n-1-2n/2 has been exceeded by multiple output resilient functions. Actually, the nonlinearity of our functions is in many cases equal to the best known nonlinearity of balanced Boolean functions. A large class of previously unknown cryptographic resilient S-boxes is obtained, and several improvements of the original approach are proposed. Some other relevant cryptographic properties are also briefly discussed. It is shown that these functions may reach Siegenthaler's bound n-t-1, and can be either of optimal algebraic immunity or of slightly suboptimal algebraic immunity, which was confirmed by simulations.

Published in:

Information Theory, IEEE Transactions on  (Volume:60 ,  Issue: 3 )