Securing Messages with RSA Cryptography Using Wagstaff Primes

This study delves into the intriguing synthesis of number theory and cryptographic applications, presenting an innovative perspective on RSA public key encryption. It explores the practical implementation of Wagstaff Prime number—a distinctive class of numerical patterns—within the framework of RSA cryptography. By leveraging the mathematical richness of Wagstaff Prime numbers, the paper seeks to enhance the conventional encryption paradigm. Key Words: Wagstaff Prime, Encryption, Decryption, RSA algorithm