The Design of a Key Expansion Algorithm Based on Dynamic Dislocation Counts

With the development of the wireless sensor networks (WSNs), the security is becoming more and more serious. The key schedules in lightweight block ciphers are often highly simplified, which causes loopholes that could be exploited in many attacks. The research on key expansion has become one of the pivotal technologies which aimed at improving performances of the encryption algorithms to solve the issue on how to guarantee enough safety and diffusion of secret key with limited resources and operations. After lucubrating and analyzing the commonly methods, a new key expansion algorithm based on the dynamic dislocation counts is proposed. The data from the simulation and verification show that the method can achieve the expansion of the key effectively and it has a good randomness. It can also be extended to the plaintext to increase the random diversity.

[1]  Shun Wen Xiao,et al.  High-Speed Parallel Implementation of AES Key Expansion Algorithm Based on FPGA , 2015 .

[2]  B. Subramanyan,et al.  Image Encryption Based on AES Key Expansion , 2011, 2011 Second International Conference on Emerging Applications of Information Technology.

[3]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[4]  Ken Umeno,et al.  Corrections of the NIST Statistical Test Suite for Randomness , 2004, IACR Cryptol. ePrint Arch..

[5]  Matthew J. B. Robshaw,et al.  Cryptographic Hardware and Embedded Systems – CHES 2014 , 2014, Lecture Notes in Computer Science.

[6]  Abdullah Rashed,et al.  A New Approach in Key Generation and Expansion in Rijndael Algorithm , 2006, Int. Arab J. Inf. Technol..

[7]  Stefan Mangard,et al.  A Simple Power-Analysis (SPA) Attack on Implementations of the AES Key Expansion , 2002, ICISC.

[8]  Johann Großschädl,et al.  Cryptographic Hardware and Embedded Systems --- CHES 2007 , 2007 .

[9]  Fuguo Deng,et al.  Reply to ``Comment on `Secure direct communication with a quantum one-time-pad' '' , 2004, quant-ph/0405177.

[10]  Johan Wallén.  Design Principles of the KASUMI Block Cipher , 2000 .

[11]  Radha Poovendran,et al.  Mitigation of Control Channel Jamming under Node Capture Attacks , 2009, IEEE Transactions on Mobile Computing.

[12]  Iman Saberi,et al.  Enhanced Key Expansion for AES-256 by using Even-Odd method , 2011, 2011 International Conference on Research and Innovation in Information Systems.

[13]  Chong Hee Kim,et al.  Improved Differential Fault Analysis on AES Key Schedule , 2012, IEEE Transactions on Information Forensics and Security.

[15]  Jhing-Fa Wang,et al.  A novel round function architecture for AES encryption/decryption utilizing look-up table , 2003, IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings..

[16]  Thomas Peyrin,et al.  The LED Block Cipher , 2011, IACR Cryptol. ePrint Arch..

[17]  Jongsung Kim,et al.  HIGHT: A New Block Cipher Suitable for Low-Resource Device , 2006, CHES.

[18]  Andrey Bogdanov,et al.  PRESENT: An Ultra-Lightweight Block Cipher , 2007, CHES.