Improved Algorithm for Thai Characters to Encryption and Decryption Processes
Kritsanapong SomsukDepartment of Computer and Communication Engineering, Faculty of Technology and Engineering, Udon Thani Rajabhat University, UDRU, Udon Thani, Thailand. kritsanapong@udru.ac.th0000-0002-7264-4628
Chanwit SuwannapongDepartment of Computer Engineering, Faculty of Engineering, Nakhon Phanom University, Thailand. schanwit@npu.ac.th0000-0002-7970-3088
Suchart KhummaneeDepartment of Computer Science, Faculty of Informatics, Mahasarakham University, Thailand 0000-0002-6078-12030000-0002-6078-1203
Mongkhon ThakongOffice of General Education, Udon Thani Rajabhat University, Thailand mongkhon@udru.ac.th0000-0002-8859-4952
Chalida SanemueangOffice of Academic Resources and Information Technology, Udon Thani Rajabhat University, UDRU, Udon Thani, Thailand. chali.sa@udru.ac.th0009-0001-2223-6909
Nuttapong BootthanuDepartment of Smart Electronics and Electric Vehicles, Faculty of Technology and Engineering, Udon Thani Rajabhat University, UDRU, Udon Thani, Thailand. nuttapong.bo@udru.ac.th0009-0005-6949-7291
This article introduces a method for converting Thai characters into pseudo-integers for encryption and decryption processes. These integers exhibit a compatible length. The proposed method includes two different parts. Initially, Thai characters are converted into pseudo numbers, which are then combined to create the plaintext. The second step requires separating the results obtained from the decryption process to reconstruct the plaintext. This method is simple because each pseudo-integer maintains a uniform size, consisting of two-digit numbers. RSA with modulus values of 1024, 2048, and 4096 bits was implemented to analyze the results. The experiment was divided into two parts. The first section evaluated the time required for processing both proposed approaches, particularly the conversion between Thai characters and numerical values. The analysis demonstrated that both methods had execution durations under one second, especially when processing 1000 characters. With the considerable input size, the average processing time remained under 10 milliseconds. Therefore, it can be claimed that proposed methods require little processing time. The second phase of the experiment included evaluating the pseudo-integer obtained from the initial study for encryption and decryption. The results demonstrated that both the encryption and decryption processes were executed within 1 second, considering an initial message is less than 1417 characters. Therefore, it can be concluded that the encryption and decryption of Thai characters, represented by pseudo-integers, can be performed rapidly and securely.