How to find d in RSA Algorithm easily? RSA Solved example

#RSAexample #RSAfindd #easymethodRSA
In this video, an example for RSA algorithm is solved and easy method to find the value of d is explained. without the need for Extended Euclidean Algorithm,d is calculated. This will be useful for students from exam point of view.

Link for easy method to find primitive root of prime number:

For more cryptography related videos:

For python related videos:

Subscribe for more new videos:

Thanks for your support,
#Trinitysoftware

[moldytexas]

I just wasted 3 hours of my life trying to figure this out myself, whereas a solution as simple as this was lying in plain sight.

[davidfoo]

The way you found d is gold! I can't thank you enough.

[Melody-rzse]

god bless you and this video, gonna save me during my exam later

[yeus]

This is far simpler than having to use the Extended Euclidean Algorithm. Thank you.

[andytechcyber]

This is such an outstanding and simplified method ever..
Thanks a lot

[hemanthgowda]

I was searching for the calculation of the d in the problem for simplified way it was very use full or the exam please continue the good work and thanx a lot 😍😍

[matthewpinon]

Fantastic tutorial. This was super easy to understand.

[shy]

Thanks a lot...this was a easy explanation

[kelemetratia]

Show how the RSA algorithm generates the private-public key pairs using the below values of p
and q:
a) p=137, q=181

b) p=373, q=479

3) For each of the key pairs in Question (2) above, show both the Encryption and decryption of a
message of your choice.

[ramabitar]

thanks a lot...it was really a big help :-)

[EDROCKSWOO]

what if d is extremely large? you just keep going to like 27?

[mahdinouira]

it don't work

11 * d mod 559 = 1
using your method it says 51 but 11 * 51 mod 559 is equal 2 not 1 !


it even don't work with this example d * 7 mod 70 = 1

[vishnutiwari]

Can we take negative value of k for finding the d?