Securing Messages with RSA Cryptography Using Wagstaff Primes
- Version
- Download 20
- File Size 356.73 KB
- File Count 1
- Create Date 24 March 2025
- Last Updated 24 March 2025
Securing Messages with RSA Cryptography Using Wagstaff Primes
Authors:
- Shanmuga Priya1, G. Janaki 2
1PG and Research Department of Mathematics, Cauvery College for Women (Autonomous), Affiliated to Bharathidasan University, Trichy-18
2PG and Research Department of Mathematics, Cauvery College for Women (Autonomous), Affiliated to Bharathidasan University, Trichy-18
Abstract - 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
Download