•  
  •  
 

Abstract

A new mathematically based cryptographic method has been proposed to improve information security; it involves transforming data into a matrix and performing bit-level operations. This decryption then follows the basic mechanism of a deterministic, fully invertible algorithm, with this invertible algorithm having the same principle as the existing ones: the process of decryption is symmetrical, where the process is reversed based on the input of the ciphertext. The plaintext is transformed into a square matrix, which includes matrix rotation, permutation of rows, circular bit shifting, and finally an affine linear transformation followed by an additional Base62-like encoding layer to further obfuscate the output. Security performance is analyzed using standard cryptographic metrics: entropy visualization, ECB detection, bit-balance analysis, runs test, avalanche effect, compression testing, and Lempel–Ziv (LZ) complexity. In addition to structured inputs, the experiments employed 100 randomly produced plaintexts of different lengths. It is worth mentioning that the ciphertexts generated show excellent statistical properties such as uniform character distribution and good diffusion, resistance to pattern-based attack, high entropy, and strong avalanche effects. These results lend support to the proposed algorithm as a candidate for educational and lightweight applications, while formal security proofs as well as peer-reviewed cryptanalysis lie outside our scope.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Share

COinS