Reinforcing RSA Cryptosystem via Galois Field

In the pursuit of robust encryption methods, securing data against evolving attacks remains a critical challenge. This paper proposes a novel enhancement to the RSA cryptosystem by integrating Galois Field (GF) arithmetic, which strengthens its mathematical foundation and resistance to key vulnerabilities. Specifically, we reformulate the modular exponentiation and key-generation phases using GF(2ᴺ) operations, reducing susceptibility to side-channel and factorization attacks. Theoretical analysis demonstrates that the proposed GF-based RSA variant improves computational efficiency while maintaining high security guarantees. Experimental results further validate its resilience against known cryptanalytic techniques, offering a viable upgrade for practical implementations.