Calculation of "d" in RSA algorithm in English

[@lalanipriyangika5939]

This method is so much easier than other methods... really helped me... Thank u very much

[@bimomuzakki9379]

I've been looking for the best solution for days and this video suddenly popped up. Thank you for saving my exam!

[@darshan.b8399]

Bro u just saved me more time in finding value of d bro,, Thank you so much❤

[@franklinrufus1170]

Bro what about bigger numbers like 121 and 151....?

[@Codebreaker0702]

Very nice trick

[@kingorigathungo433]

Thank you so much for this simplified method

[@khalidking3394]

thank youuuu , you helped me a looooottt ; i have an exame in cryptographie after tomorrow

[@greenstonegecko]

ayo did you pass bro?

[@khalidking3394]

@@greenstonegecko yes i pass it

[@ruzarfernandes8918]

now i am seeing this video as my exam is after tmrw

[@khalidking3394]

@@ruzarfernandes8918 good luck bro

[@thorbjrnjariikkala837]

Is there a formula to make it easier with big numbers?

[@papisway2211]

Your last step is not clearly understood. How is d= 3 where (21 x d) = 3 mod 20?

[@engineeringcourt]

For making the equation equivalent to 21, we multiplied 3 to each sides.. now the eqn becomes 21*d= 3 mod 20..now 21 mod 20. Equals to 1.. so the eqn will be 1*d = 3 mod 20.. whenever the coefficient of d becomes 1 the value on the RHS side will be equal to d.. is it clear now,?

[@imanariyobaptiste8177]

and atleast i subscribed for my first time thanks

[@kadharhussan1940]

Excellent

[@introvertvsextrovert747]

Make video on how to calculate e

[@Cutyofoot]

e is a number relatively prime to fi n

[@SoWasRed]

Oh my god...this is so easy. Thank u bai

[@imanariyobaptiste8177]

the genius always deserves the best blessing from God dad you rescued my mind Dad

[@CheyziEdits]

Thank you, that was very easy and understandable

[@engineeringcourt]

Thank you, keep supporting 😀

[@HillmountHeights]

Bro awesome …..it was the easiest step 😍

[@vikas20]

Thank you so much

[@rithsinawatra9995]

This method is not always working, try dx8 = mod 60.

[@rdwok14]

What is the name of this algorithm?

[@MayurShinde-rc2lj]

Sum 1 ,
If equation will be multiple by 27
Isn't it will be 81× 27d ?

[@jimmydim2212]

Thank you!!

[@aartiyadav5213]

Thank u sir 👍 it really helped alot...

[@engineeringcourt]

Thanks and keep supporting

[@shrutisoni5376]

It really helped me

[@bilasweet9369]

thank you so much,

[@gopasprem7607]

how to solve for P=3,Q=11,E=7?

[@mahdinouira3261]

it don't work when in this example
n = 119
fi(n) 96
e = 5

[@rishiyaswanth]

thank you sir for simple explanation

[@dikshitkanani6298]

thanks

[@engineeringcourt]

Thanks keep supporting😄

[@minu3554]

Sir can you please teach how the public key (e) is calculated when private key (d) is given in the question

[@c00per_]

How to?

[@sadiarizwan932]

Thank u sooo soo much sir g

[@88sujanpandey]

thanks a lot

[@anmol2268]

Thanks u sir ❤

[@kunalh910]

It is usesless for large numbers as it will consume a lot of time !

[@abubakaribrahimabk5817]

Thanks 🙏

[@nikhilshrivastav7694]

bhai e niklana bhi batao

[@anasansari7794]

sir please tell 13 * d mod 60 = 1

[@simontriestri]

Thank you gangy

[@coxandrewj]

Not really practical with big numbers.

[@engineeringcourt]

Will be uploading another trick soon to solve it for big numbers

[@ashwinbharambe5367]

rsa algorithm n=221 and e=5 find d can you give me solution of this

[@engineeringcourt]

can you please confirm if the answer is 177…

[@sujathasivakumar6422]

17*d=1mod 60.what is the d value

[@saivardhangoud9152]

53

[@aanchalsharma5264]

Thank u

[@EDROCKSWOO]

dude 3 = 1 mod 60 is never ending decimal number

[@harshsable8806]

Please Calculate 7*d = 1 mod 60

[@manojgurram4689]

Hi can you please find private key for P=143 and Q=11 , helps me alot....Thanks

[@devkapadia423]

*Not applicable for all numbers

[@advertiserbeast7033]

nice one

[@Cutyofoot]

5

[@kyrostsa1180]

you save me!

[@pelageya22]

Збс, а русским как быть?!

[@LenS0r]

Так все же понятно)))

[@kothauday6276]

Thank u