-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprime_generation.cpp
179 lines (173 loc) · 3.67 KB
/
prime_generation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#include <bits/stdc++.h>
#include <gmp.h>
#include <unistd.h>
#include <cstdio>
using namespace std;
void generate_keys(mpz_t e, mpz_t d, mpz_t n);
void generate_prime(mpz_t prime_value, int bits);
void generate_random_number(mpz_t r_number, int size);
void build_dictionary(mpz_t dict[][2], mpz_t p_key[],int c_size);
int generate_strong_prime(mpz_t pf, mpz_t p1, mpz_t p2);
int main()
{
FILE *dic;
FILE *pri;
int companies = 0;
printf("Enter the number of companies:");
cin>>companies;
mpz_t dict[companies][2],p_key[companies];
build_dictionary(dict,p_key,companies);
dic = fopen("directory.txt","w");
pri = fopen("private.txt","w");
fprintf(dic, "Directory:\n");
int k = 0;
try{
for(int i=0;i<companies;i++)
{
fprintf(dic,"Company %d\n",(i+1));
fprintf(dic,"Public Keys:\ne:");
k = mpz_out_str(dic,10,dict[i][0]);
if(k==0)
throw "Error occured while input-output operation";
fprintf(dic, "\nn:");
k = mpz_out_str(dic,10,dict[i][1]);
if(k==0)
throw "Error occured while input-output operation";
fprintf(dic, "\n");
fprintf(pri,"Company %d\n",(i+1));
fprintf(pri, "Private Key:\nd:");
k = mpz_out_str(pri,10,p_key[i]);
if(k==0)
throw "Error occured while input-output operation";
fprintf(pri, "\n");
}
}
catch(string e)
{
cout<<e<<"\n";
}
fclose(dic);
fclose(pri);
}
void build_dictionary(mpz_t dict[][2], mpz_t p_key[], int c_size){
mpz_t e,d,n;
for(int i=0;i<c_size;i++)
{
mpz_inits(dict[i][0],p_key[i],dict[i][1], NULL);
generate_keys(dict[i][0],p_key[i],dict[i][1]);
gmp_printf("%Zd\n%Zd\n%Zd\n",dict[i][0],p_key[i],dict[i][1]);
}
}
void generate_keys(mpz_t e, mpz_t d, mpz_t n){
mpz_t p,q,s,t,phi_n;
mpz_inits(p,q,s,t,phi_n,NULL);
while(true)
{
generate_prime(s,256);
usleep(1000000);
generate_prime(t,256);
int check = generate_strong_prime(p,s,t);
if(check == 1)
break;
}
usleep(1000000);
while(true)
{
generate_prime(s,256);
usleep(1000000);
generate_prime(t,256);
int check = generate_strong_prime(q,s,t);
if(check == 1)
break;
}
mpz_mul(n,p,q);
mpz_sub_ui(p,p,1);
mpz_sub_ui(q,q,1);
mpz_mul(phi_n,p,q);
while(true){
generate_random_number(e,1010);
int p = mpz_invert(d,e,phi_n);
if(p==0)
continue;
else
break;
}
mpz_clears(p,q,s,t,phi_n,NULL);
}
void generate_prime(mpz_t prime_value, int bits){
gmp_randstate_t state;
unsigned long seed = static_cast<unsigned long>(time(NULL));
gmp_randinit_mt(state);
gmp_randseed_ui(state,seed);
while(true)
{
mpz_urandomb(prime_value,state,bits);
//generate_random_number(prime_value, bits);
int p = mpz_probab_prime_p(prime_value, 25);
if (p==2 || p==1)
break;
else
continue;
}
gmp_randclear(state);
}
void generate_random_number(mpz_t r_number, int size){
gmp_randstate_t state;
unsigned long seed = static_cast<unsigned long>(time(NULL));
gmp_randinit_mt(state);
gmp_randseed_ui(state,seed);
mpz_urandomb(r_number,state,size);
gmp_randclear(state);
}
int generate_strong_prime(mpz_t pf, mpz_t p1, mpz_t p2){
int i=1;
mpz_t r,p0,r1;
mpz_inits(r,p0,r1,NULL);
while(true)
{
mpz_mul_ui(r,p2,2*i);
mpz_add_ui(r,r,1);
int p = mpz_probab_prime_p(r, 25);
if (p==2 || p==1)
break;
else
{
if(i>500)
{
return 0;
}
i = i+1;
continue;
}
}
mpz_sub_ui(r1,r,2);
mpz_powm(p0,p1,r1,r);
mpz_mul_ui(p0,p0,2);
mpz_mod(p0,p0,r);
mpz_mul(p0,p0,p1);
mpz_sub_ui(p0,p0,1);
i = 1;
while(true)
{
// cout<<i<<" ";
mpz_mul(pf,r,p1);
mpz_mul_ui(pf,pf,2*i);
mpz_add(pf,pf,p0);
int p = mpz_probab_prime_p(pf, 25);
if (p==2 || p==1)
break;
else
{
if(i>500)
{
// cout<<"\n";
return 0;
}
i = i+1;
continue;
}
}
// cout<<"\n";
mpz_clears(r,p0,r1,NULL);
return 1;
}