Cart (Loading....) | Create Account
Close category search window
 

Detection of weak s-boxes in block-ciphers by means of statistical testing

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)
Tychopoulos, A. ; Dept. of Electr. & Comput. Eng., Univ. of Patras, Rio, Greece ; Charitos, L.

Employment of non-linear permutations (s-Boxes) is central to the security of block ciphers. On the other hand, statistical testing (for randomness) is an essential tool for the evaluation of ciphers, included in all recognized batteries-of-tests. Statistical tests however examine ciphers as a “whole”; consequently, the contributions of individual building blocks of the cipher in the overall performance are difficult to trace back to their “origins”. In particular, it is an open question, whether the existence of redundant s-Boxes i.e. the ones with negligible contribution to the performance of the cipher, can be detected by means of statistical testing all alone. The aim of our work is to estimate the confidence that redundant s-Boxes will be detected, when exclusive use of statistical tests is made. More specifically, we applied the so-called “Crypt-X'98” suite on a suitably modified version of the “Serpent” cipher (finalist, AES). Our modifications on “Serpent” were limited to the choice of s-Boxes and the count of encryption-rounds. We took into consideration the four most important randomness-criteria and three encryption-modes. We prove that the security of a cipher cannot be fully characterized by means of randomness-testing.

Published in:

Communication Systems, Networks & Digital Signal Processing (CSNDSP), 2012 8th International Symposium on

Date of Conference:

18-20 July 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.