RSA Algorithm

preview_player
Показать описание
RSA (Rivest–Shamir–Adleman) is an algorithm used to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm.
Рекомендации по теме
Комментарии
Автор

Tomorrow my semester exam... Now only I'm studying this RSA😂.... It's clearly undershirt mam🙏🏻💥... Thank u so much❤️... Keep uploading more videos💥🔥

editing_spotu
Автор

Great explanation ❌
Great documentation ✅

sudhakar_yt
Автор

Its an simplest explaination of rsa, i found on youtube, thank you mam

badal
Автор

My first time learning RSA and it's clearly understood.Thanks very much 😊

simoherman
Автор

Thanku for helping me by explaining rsa algorithm on YouTube madam. U r the supply sem exam saver madam.

chiruvellabalakarthikeyan
Автор

3 hrs before exam, what's wrong with me😂

mkson
Автор

Very good explanation...explained the whole topic in short time and simple way to understand
amazing video

botplayer
Автор

How did yu take d=3 out of nowhere? Isn't that what we need to find? And to find out the value yu consider 3 randomly?(someone explain if yu know)

jenithasharu
Автор

wow wow, This is what I am talking about Great video, clear and precise and straight to the point. . Thank you

ox
Автор

A very good video with clear notes!!! Highly recommend!

YijinYang
Автор

Thank you maam i understand this concept now. If RSA algo asked in tommorow exam i will surely achieve full marks in that question.

virajgajdhar
Автор

if it was possible for to give a million likes i would have multiplied that by another nillion
good explanation

erichalale
Автор

Well explained
Easily understandable
Please make more videos on cryptographic algorithms, DES, SHA-256

EstherIdang
Автор

why did you take same public and private key ... ruined 😢

sheikhraisulislam
Автор

surely out of all, your's the simplest and easy way to understand. Use less duration so that it reaches all. Tq.

eswarboss
Автор

video is very informative. As it is RSA(asymmetric), can public and private key be the same? or should we consider 19 as private key when public key is 3

suprajaganne
Автор

Explain why you choose d=3 directly to solve (d.e)%Q(n)=1?

Lioneltaklai
Автор

It's a very easisest way of explanation Mam, Thanks allot.

yashaspa
Автор

Really simple and consise explanation! Thanks a lot mam !

adityamali
Автор

what is the case when we consider e=5 and e=7 how do you calucltae d then
as d*e mod(8)=1
if you consider e=5 or 7 which satidfies the condition e is greate r than 1 and e<pie of n nad gcd of(5, 8) or Gcd(7, 8)=1
then how will you get the value of d here?
if considered 5 or 7 as e
d*5 mod 8 =1
so iam not sure how do we derive d here
could you please explain

sankeerthsharma