Abstract

Advanced Encryption Standard (AES) algorithm is considered as a secured algorithm. Still, some security issues lie in the S-Box and the key used. In this paper, we have tried to give focus on the security of the key used. Here, the proposed modified algorithms for the AES have been simulated and tested with different chaotic variations such as 1-D logistic chaos equation, cross chaos equation as well as combination of both. For the evaluation purpose, the CPU time has been taken as the parameter. Though the variations of AES algorithms are taking some more time as compared to the standard AES algorithm, still the variations can be taken into consideration in case of more sensitive information. As we are giving more security to the key used for AES algorithm, our proposed algorithms are very much secured from unauthorized people.

Highlights

  • Due to the advancements in the Internet technology, huge digital data are transmitted over the public network

  • AES (Advanced Encryption Standard) algorithm is based on substitution and permutation principles

  • 1-D logistic chaos equation has been taken for encryption of the key used in AES algorithm

Read more

Summary

INTRODUCTION

Due to the advancements in the Internet technology, huge digital data are transmitted over the public network. As the public network is open to all, protection of these data is a vital issue. For protecting these data from the unauthorized people, different encryption and decryption algorithms have been developed. Out of these algorithms, AES (Advanced Encryption Standard) algorithm is very much secured [1, 2]. In 2010, El-Sayed Abdoul-Moaty ElBadawy et al and in 2011, Zhang Zhao et al have modified the standard AES algorithm by modifying the S-box generation using 1-D logistic chaos equation [4, 5]. We have used the 1-D logistic chaotic equation, Cross-chaotic equation and the combined version of these two techniques

AES ALGORITHM
CROSS CHAOS SEQUENCE
PROPOSED ALGORITHMS
Proposed Algorithm using 1-D Logistic Chaos Equation
Analysis of Different Proposed Algorithms
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.