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

A block cipher using key-dependent S-box and P-boxes

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)

Block ciphers based on key-dependent cipher structures have been investigated for years, however, their overall performance in terms of security and speed has not been sufficiently addressed. In this paper, we propose a 128-bit Feistel block cipher, which simultaneously engages key-dependent S-box and key-dependent P-box. With these two key-dependent transformations, the internal structure of this cipher algorithm is secured, so as to resist the linear and differential cryptanalysis in a few round encryptions. Hence, the encryption and decryption functions are quite efficiency. We named this key-dependent structure the DSDP structure, and the cipher DSDP. A fast permutation algorithm is used to generate both the key-dependent S-box and key-dependent P-boxes. This greatly compensates the performance penalty of complex key schedule. The basic operations used in DSDP are all efficient bytewise operations, so the algorithm will have a reasonable fast speed on recent processors, 16-bit processors and smart cards as well as 8-bit processors. We implement the algorithm with C and Java respectively on several PCs with different processors, and estimate the optimized assembly performance on Pentium. The experimental results and the estimation show that DSDP has a very fast encryption/decryption speed and a reasonable fast key scheduling implementation.

Published in:

Industrial Electronics, 2008. ISIE 2008. IEEE International Symposium on

Date of Conference:

June 30 2008-July 2 2008

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.