A Secure Taylor Expansion–Based Data Encryption Algorithm Using Effective Permutations

Abstract

The paper proposes a lightweight exploratory encryption framework to explore the substitution of dynamic permutation based on Taylor-series for the encryption of text. The proposed method inputs plaintext and a key value. In the next step the key value is converted into dynamic key value (DKV) and the plaintext is converted into its corresponding ASCII sequence which is finally transformed using Taylor’s series-based operations to produce cipher text. The security and speed of the proposed method were evaluated by measuring encryption and decryption times along with plaintext and key based avalanche effects. The observed results showed computational efficiency of 11 characters of plaintext with a variable length of numeric key setup. Under experimental conditions, the time spent for encryption was 0.0005 seconds and the time spent for decryption was 0.0001 seconds. The experimental conditions employed led to promising avalanche characteristics to the proposed technique: key-based changes - 83.75%, plaintext-based changes - 55.45%. The hybrid structure has been optimized by means of both permutation and nonlinear substitution operations, which are well suited for lightweight exploratory encryption applications as it is optimized for confusion and diffusion for such applications. The proposed solution shall be viewed in this context as another pioneering lightweight encryption scheme for research in academia and simple level text-encryption research.