Optimizing Cryptographic Security through Innovative Utilization of the K-Transform Algorithm

This paper addresses the relatively limited research concerning the use of integral transforms in cryptographic systems. It introduces a new method for encryption and decryption, one that's based on the K-Transform and its inverse. The proposed method begins by converting plaintext messages into numerical sequences. These are then represented as polynomials. The K-Transform is applied to these polynomials; this, along with modular arithmetic, then produces the ciphertext. Decryption involves reversing the modular operation and applying the inverse K-Transform. This guarantees the accurate and complete recovery of the original message. To support this methodological framework, we provide practical examples and visual illustrations. These offer direct insight into how the transformation process behaves and can be reversed. Experimental results demonstrate that this technique maintains data integrity, reversibility, and computational efficiency. Consequently, it's particularly well-suited for resource-constrained environments, such as IoT devices and embedded systems. Ultimately, this study positions the K-Transform as a viable alternative to traditional cryptographic primitives, establishing a foundational framework for further exploration in transform-based encryption. The work opens new avenues for enhancing security mechanisms in modern secure communication systems.