/* Def: RSA is an asymmetric cryptography algorithm which works on two keys-public key and private key. Directly click 👉RUN▶ Ref: https://www.geeksforgeeks.org/rsa-algorithm-cryptography/ https://www.tutorialspoint.com/cplusplus-program-to-implement-the-rsa-algorithm Sorry guys i'm failed😢 to implement this method to string messages. This code takes too much time but i failed to get expected output on strings. I'm leaving this now. If you can fix check commented lines. */ #include #include using namespace std; // Returns gcd of a and b int gcd(int a, int b) { int temp; while (1) { temp = a%b; if (temp == 0) return b; a = b; b = temp; } } int main() { // Two random prime numbers double p = 53; double q = 59; // First part of public key: double n = p*q; // Finding other part of public key. double e = 3; double phi = (p-1)*(q-1); while (e < phi) { // e must be co-prime to phi and // smaller than phi. if (gcd(e, phi)==1) break; else e++; } // Private key (d stands for decrypt) // choosing d such that it satisfies // d*e = 1 + k * totient //double k = 2; // A constant value //double d = (1 + (k*phi))/e; double d1=1/e; double d=fmod(d1,phi); // Message to be encrypted double msg=20; double c=pow(msg,e); double m=pow(c,d); c=fmod(c,n); m=fmod(m,n); cout<<"Original Message = "<

RSA algorithm