4k views

### Finding d given everything else in RSA [duplicate]

I've got everything else (e, p, q, phi(n), n), but cannot see a way to figure out what d should be. P and q are both 300 digits, so phi(n) and n are about 600 digits, but e is only 5 digits. I do ...
2k views

### Find private exponent in RSA [duplicate]

The other answers for this confuse me, I know the principle of d in terms of the equation it has to satisfy. However I'm not sure how I would go about finding the private exponent without trial and ...
3k views

### How to calculate d in RSA for my number with this [duplicate]

I took the p&q value as 61 & 53 and n=3233 e=17 d=? How to find it? Plz help me...
2k views

### how do you calculate the private exponent in asymmetric key encryption [duplicate]

Here is an excellent paper on the math of asymmetric key encryption: http://www.mathaware.org/mam/06/Kaliski.pdf‎ See the example on Page 6. The public key = $55$ Primes used to calculate public ...
1k views

### Extended Euclidean Algorithm in RSA [duplicate]

I am trying to solve an RSA problem. In order to calculate $d$, I have to calculate $d$ with $e=3$ and $$d\cdot e\equiv1 \pmod{40}$$ Obviously the answer is $d=27$, but I want to solve this with the ...
635 views

### RSA problem - how to find $d$ [duplicate]

For example, let $p = 3$ and $q= 11$, choose $e = 3$. What computation I have to apply in order to find the corresponding $d$? I know it's 7, but I want to know the exact process to be applied to find ...
600 views

### Factorizing N to derive D [duplicate]

So I have the value of N. I have to use this value of N to find the value of D. N = 265291078722948385089717069136983657793 Now I read about RSA algos and found out that ...
427 views

### RSA encryption using euclidean alorithm [duplicate]

when given p=5, q=19, e=5 solution:- n=5*19 =95 φ (n)=4*18 =72 de=1 modφ (n) d(5)=mod(72) using euclidean algorithm 72=14(5)+2 5=2(2)+1 back substituition 1=5-2(2) 1=5-2[72-...
87 views

### Finding Private Key $d$ using RSA [duplicate]

I'm a RSA n00b when it comes to the mathematics for RSA. After spending some time reading, watching lectures, etc. I pretty much have everything down, except for how to figure out the equation for ...
65 views

### RSA: If I know n, e, p, and q, how do I calculate d using the extended euclidean algorithm? [duplicate]

After doing a good amount of research, it's become fairly obvious that I ought to be using the extended Euclidean algorithm to calculate d from the data that I already have. However, this isn't an ...
57 views

### trying to get calculator and RSA calculatin does not make sense [duplicate]

got two question, I am novice in the area of crypto and currently in big learning curve. From crypto book I am going over with, I see the RSA algorithm example as follows: it chose two rand #-s: p=...
47 views

### Verifying valid public key and finding private key? [duplicate]

A naive user of RSA has announced the public key $n = 2903239, e = 5$. Eve has worked out that $n = 1237×2347$. Verify that the public key is valid and explain why the private key is $d = 2319725$. [...
32 views

### Generating keys in RSA [duplicate]

I'm trying to learn how RSA works. From what I found online, I'm supposed to generate private key using Extended Euclidean algorithm. I've managed to generate the public key, but don't know how to ...
Quite frankly, it is a pain to use the Extended Euclidean Algorithm to calculate d (the private exponent) in RSA. The equation used to find d is: $$e d \equiv1~(\mathrm{mod}~ \varphi(n)).$$ Does ...