•  
  •  
 

Abstract

This paper introduces a cryptographic technique combining the Kharrat-Toma Transform and congruence modulo operators to improve the security of message encryption. The proposed model uses the mathematical properties of the Kharrat-Toma Transform and its inverse for direct scrambling and unscrambling processes while embedding sufficient complexity to resist modern cryptanalytic attacks. The model is subjected to experimental tests, including encryption quality analysis, Shannon entropy, and NIST randomness tests, in order to prove the strength of the model. Through encryption quality analysis, symbol frequencies in the ciphertext are masked heavily from having much correlation between plaintext and ciphertext. Entropy values indicate near-theoretical maximum for ciphertext, showing unpredictability and robustness toward statistical attacks. In addition, the model passes all NIST randomness tests, such as frequency, block frequency, and approximate entropy, hence proving quite effective. The approach conceals information better than standard cryptography approaches while resisting frequency and structure analysis-based attacks. This new method strikes a good balance between computation and security, providing safeguards for critical data in modern digital systems while providing greater resilience against emerging cryptographic attacks.

Download

Share

COinS