A Novel Substitution Ciphering Algorithm for Data Encryption

Modern digital communication relies heavily on text encryption to ensure secure communications and protect sensitive information. With the growth of the internet and digital communication, authorized and secure access has become more prevalent. Encryption is a way to protect this information by converting it into an unintelligible format, which can only be decrypted by authorized personnel with the appropriate encryption keys. In this paper, we propose a novel method for generating a new substitution lookup table that is resistant to known plaintext attacks and other cryptanalysis attacks. This method involves the use of cardinal tables to create a novel substitution lookup table. The proposed table provides a decimal code with a length varying from 3 to 5 digits for each alphabet letter. The nonlinear substitution of letters with new codes, generated from the proposed table, makes it suitable for data encryption and decryption. Sample messages are encoded with the proposed approach and the resulting encoded messages are compared with their ASCII codes. The obtained results with the novel table have been compared also with the conventional text encryption algorithms (Hill and Vigenere ciphering codes). The results show that the proposed lookup table gives the best histogram distribution, the lowest correlation coefficient, and the highest value of entropy results