Scribd
Upload
27 views5 pages

5-Develop a chipper scheme by using RSA-19-02-2025

The document provides a C program implementing the RSA algorithm for encryption and decryption. It includes functions for checking prime numbers, calculating public and private keys, and performing the encryption and decryption processes. The program prompts the user for two prime numbers and a message, then displays the encrypted and decrypted results.

Uploaded by

aakriti.goenka.004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views5 pages

5-Develop a chipper scheme by using RSA-19-02-2025

The document provides a C program implementing the RSA algorithm for encryption and decryption. It includes functions for checking prime numbers, calculating public and private keys, and performing the encryption and decryption processes. The program prompts the user for two prime numbers and a message, then displays the encrypted and decrypted results.

Uploaded by

aakriti.goenka.004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

RSA Algorithm

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>

long int p, q, n, t, flag, e[100], d[100], temp[100], j, m[100], en[100], i;


char msg[100];

int prime(long int);


void ce();
long int cd(long int);
void encrypt();
void decrypt();

int main()
{
printf("ENTER FIRST PRIME NUMBER: ");
scanf("%ld", &p);
flag = prime(p);
if (flag == 0 || p == 1)
{
printf("WRONG INPUT\n");
exit(1);
}

printf("ENTER ANOTHER PRIME NUMBER: ");


scanf("%ld", &q);
flag = prime(q);
if (flag == 0 || q == 1 || p == q)
{
printf("WRONG INPUT\n");
exit(1);
}

printf("ENTER MESSAGE: ");


scanf(" %[^\n]s", msg);
for (i = 0; i < strlen(msg); i++)
m[i] = msg[i];

n = p * q;
t = (p - 1) * (q - 1);

ce();

printf("\nPOSSIBLE VALUES OF e AND d ARE:\n");


for (i = 0; i < j - 1; i++)
printf("%ld\t%ld\n", e[i], d[i]);

encrypt();
decrypt();

return 0;
}

int prime(long int pr)


{
int i;
if (pr == 1)
return 0;

for (i = 2; i <= sqrt(pr); i++)


{
if (pr % i == 0)
return 0;
}
return 1;
}

void ce()
{
int k;
k = 0;
for (i = 2; i < t; i++)
{
if (t % i == 0)
continue;
flag = prime(i);
if (flag == 1 && i != p && i != q)
{
e[k] = i;
flag = cd(e[k]);
if (flag > 0)
{
d[k] = flag;
k++;
}
if (k == 99)
break;
}
}
}

long int cd(long int x)


{
long int k = 1;
while (1)
{
k = k + t;
if (k % x == 0)
return (k / x);
}
}

void encrypt()
{
long int pt, ct, key = e[0], k, len;
i = 0;
len = strlen(msg);
while (i < len)
{
pt = m[i];
pt = pt - 96;
k = 1;
for (j = 0; j < key; j++)
{
k = k * pt;
k = k % n;
}
temp[i] = k;
ct = k + 96;
en[i] = ct;
i++;
}
en[i] = -1;
printf("\nTHE ENCRYPTED MESSAGE IS:\n");
for (i = 0; en[i] != -1; i++)
printf("%c", (char)en[i]);
}

void decrypt()
{
long int pt, ct, key = d[0], k;
i = 0;
while (en[i] != -1)
{
ct = temp[i];
k = 1;
for (j = 0; j < key; j++)
{
k = k * ct;
k = k % n;
}
pt = k + 96;
m[i] = pt;
i++;
}
m[i] = -1;
printf("\nTHE DECRYPTED MESSAGE IS:\n");
for (i = 0; m[i] != -1; i++)
printf("%c", (char)m[i]);
}

Sample Result:

Exercise1: Perform encryption and decryption for the following inputs using RSA algorithm. Compare
the theoretical calculations with simulated outcomes.

You might also like