BigNumber-RSA-Implementation/RsaModule.cpp at main · TurgutKanceltik/BigNumber-RSA-Implementation · GitHub

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
#include "RsaModule.h"
#include <iostream>

using namespace std;

LongNumber RsaModule::Keygen(LongNumber* p, LongNumber* q, LongNumber* e, int lenght)
{
	LongNumber temp;
	string answ;
	cout << "Do you want to set values manually ? (yes/no): ";
	cin >> answ;
	if (answ == "yes")
	{
		cout << "'P': ";
		cin >> answ;
		*p = *new LongNumber(answ);

		cout << "'Q': ";
		cin >> answ;
		*q = *new LongNumber(answ);

		cout << "'E': ";
		cin >> answ;
		*e = *new LongNumber(answ);
	}
	else
	{
		*p = temp.generateprime(lenght);
		*q = temp.generateprime(lenght);
		*e = temp.generateprime(lenght);
	}

	cout << "'P' value : " + (*p).getString() << endl;
	cout << "'Q' value : " + (*q).getString() << endl;
	cout << "'E' value : " + (*e).getString() << endl;

	bool answer;
	while (true)
	{
		answer = (*p).IsPrime();
		if (answer == false)
		{
			cout << "'P' is not prime please set again: ";
			*p = temp.generateprime(lenght);
			cout << "'P' new value : " + (*p).getString() << endl;
		}
		else
			break;
	}

	while (true)
	{
		answer = (*q).IsPrime();
		if (answer == false)
		{
			cout << "'Q' is not prime please set again: ";
			*q = temp.generateprime(lenght);
			cout << "'Q' new value : " + (*q).getString() << endl;
		}
		else
			break;
	}

	while (true)
	{
		answer = (*e).IsPrime();
		if (answer == false)
		{
			cout << "'E' is not prime please set again: ";
			*e = temp.generateprime(lenght);
			cout << "'E' new value : " + (*e).getString() << endl;
		}
		else
			break;
	}

	LongNumber One;
	One._bigNumber.Num[0] = 1;
	LongNumber PMinusOne = (*p).Sub(One);
	LongNumber QMinusOne = (*q).Sub(One);
	LongNumber PhiValue = PMinusOne.Mul(QMinusOne);

	cout << "'Phi' Value: ";
	cout << PhiValue.getString() << endl;

	return PhiValue;
}

LongNumber RsaModule::RsaEncrypt(LongNumber e, LongNumber n)
{
	string msg;
	cout << "Encrypt Value: ";
	cin >> msg;

	LongNumber result = *new LongNumber(msg);
	result = result.ExpMod(e, n);

	cout << "Secret: " + result.getString() << endl;
	return result;
}

LongNumber RsaModule::RsaDecrypt(LongNumber d, LongNumber n)
{
	string msg;
	cout << "Decrypt Value: ";
	cin >> msg;

	LongNumber result = *new LongNumber(msg);
	result = result.ExpMod(d, n);

	cout << "Result: " + result.getString() << endl;
	return result;
}

void RsaModule::testRsa()
{
	RsaModule rsaModule;
	LongNumber* PArray = new LongNumber("0");
	LongNumber* QArray = new LongNumber("0");
	LongNumber* EArray = new LongNumber("0");

	LongNumber phi = rsaModule.Keygen(PArray, QArray, EArray, 2);

	cout << "'N' Value: ";
	LongNumber n = (*PArray).Mul(*QArray);
	string Print = n.getString();
	cout << Print << endl;

	LongNumber encryptValue = rsaModule.RsaEncrypt((*EArray), n);

	cout << "'D' Value: ";
	LongNumber d = (*EArray).Inverse(phi);
	Print = d.getString();
	cout << Print << endl;

	LongNumber decryptValue = rsaModule.RsaDecrypt(d, n);
}