htamas1210/rsa
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

deleted misc

Browse Source
This commit is contained in:
Hatvani Tamás
2026-04-14 09:02:25 +02:00
parent fd3700c960
commit b5f389264a
1 changed files with 2 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
main.c
View File

@@ -188,17 +188,6 @@ uint64_t kinai_maradek_tetel(uint64_t *m, uint64_t d, prime_test_t *p, prime_tes
euklidian_result_t y = euklidian_algorigthm_extended(Mp, Mq); // in the struct the x will mean the y1 and y will mean the y2
// if either of them is less a negative number shift them into postive range with with hte modulo
// y.x %= p->prime;
// if (y.x < 0)
// y.x += p->prime;
//
// y.y %= q->prime;
// if (y.y < 0)
// y.y += q->prime;
//
// unsigned __int128 s1 = (c1 * y.x * Mp) % M;
// unsigned __int128 s2 = (c2 * y.y * Mq) % M;
// return (s1 + s2) % M;
uint64_t y1_pos;
if (y.x < 0) {
y1_pos = p->prime - (uint64_t)(-y.x % p->prime);
@@ -263,8 +252,9 @@ int main() {
printf("\n");
uint64_t m = 0;
printf("give input for m: \n");
printf("give input for m: ");
scanf("%ju", &m);
printf("\n");
srand(time(NULL));
@@ -280,8 +270,6 @@ int main() {
pthread_join(thread_q, NULL);
printf("\n");
p.prime = 3000000019;
q.prime = 4000000007;
printf("p: %u\n", p.prime);
printf("q: %u\n", q.prime);