A Robust and Fast Symmetric Text Encryption Algorithm Based on Fermat's Two Squares Theorem

In the digital age, the integrity and privacy of information transmitted, communicated over computer networks or stored on computer systems are crucial. This paper suggests a novel and robust symmetric encryption scheme based on Fermat's theorem to facilitate seamless and secure communication while preserving the confidentiality and integrity of data sent over a public channel. The knowledge of the public key does not reveal any valuable information to an intruder for computing the encryption/decryption keys used here. An essential feature of this scheme is that no additional information is passed again through the public channel or a private courier in the computation of the encryption/decryption keys. Also, the keys are dynamic for each data transmission, and the Plaintext and Ciphertext are not the same lengths. Consequently, the proposed encryption-decryption technique is safer against all possible standard attacks and more efficient than the existing encryption algorithms.