#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
#include <sys/time.h>
// Function to check if a number is prime
int is_prime(unsigned long long number) {
if (number <= 1) {
return 0;
}
for (unsigned long long i = 2; i * i <= number; i++) {
if (number % i == 0) {
return 0;
}
}
return 1;
}
// Function to generate a prime number
unsigned long long generate_prime(unsigned long long min, unsigned long long max) {
unsigned long long number;
do {
struct timeval tv;
gettimeofday(&tv, NULL);
srand(tv.tv_usec);
number = rand() % (max - min + 1) + min;
} while (!is_prime(number));
return number;
}
// Function to calculate the greatest common divisor
unsigned long long gcd(unsigned long long a, unsigned long long b) {
while (b != 0) {
unsigned long long temp = b;
b = a % b;
a = temp;
}
return a;
}
// Function to generate a coprime number with phi_n
unsigned long long generate_coprime(unsigned long long phi_n) {
unsigned long long e;
do {
struct timeval tv;
gettimeofday(&tv, NULL);
srand(tv.tv_usec);
e = rand() % (phi_n - 2) + 2;
} while (gcd(phi_n, e) != 1);
return e;
}
// Function to generate the private key
unsigned long long generate_private_key(unsigned long long e, unsigned long long phi_n, unsigned long long *time_taken) {
unsigned long long d = 0;
unsigned long long k = 1;
struct timeval start_time, end_time;
gettimeofday(&start_time, NULL);
while (1) {
d = (k * phi_n + 1) / e;
if (e * d == k * phi_n + 1) {
break;
}
k++;
}
gettimeofday(&end_time, NULL);
*time_taken = (end_time.tv_sec - start_time.tv_sec) * 1000000 + (end_time.tv_usec - start_time.tv_usec);
return d;
}
// Function to encrypt a message using the public key
unsigned long long encrypt(unsigned long long message, unsigned long long e, unsigned long long n) {
unsigned long long result = 1;
for (unsigned long long i = 0; i < e; i++) {
result = (result * message) % n;
}
return result;
}
// Function to decrypt an encrypted message using the private key
unsigned long long decrypt(unsigned long long encrypted_message, unsigned long long d, unsigned long long n) {
unsigned long long result = 1;
for (unsigned long long i = 0; i < d; i++) {
result = (result * encrypted_message) % n;
}
return result;
}
int main() {
// Generate two prime numbers
unsigned long long p = generate_prime(1000000000000, 9999999999999);
unsigned long long q = generate_prime(1000000000000, 9999999999999);
// Compute n and phi(n)
unsigned long long n = p * q;
unsigned long long phi_n = (p - 1) * (q - 1);
// Generate public and private keys
unsigned long long e = generate_coprime(phi_n);
unsigned long long d;
unsigned long long time_taken[64];
// Print public key
printf("Public key: (%llu, %llu)\n", e, n);
// Generate and print private key
printf("Private key: (");
for (unsigned long long i = 0; i < 64; i++) {
d = generate_private_key(e, phi_n, &time_taken[i]);
printf("%llu", (d >> i) & 1);
if (i != 63) {
printf(", ");
}
}
printf(")\n");
// Print time taken to generate each bit of private key
printf("Time taken to generate each bit of private key:\n");
for (unsigned long long i = 0; i < 64; i++) {
printf("Bit %llu: %llu us\n", i, time_taken[i]);
}
// Encrypt and decrypt a message
unsigned long long message = 123456789;
unsigned long long encrypted_message = encrypt(message, e, n);
unsigned long long decrypted_message = decrypt(encrypted_message, d, n);
printf("Original message: %llu\n", message);
printf("Encrypted message: %llu\n", encrypted_message);
printf("Decrypted message: %llu\n", decrypted_message);
return 0;
}