#28. RSA Algorithm - Asymmetric key cryptography |CNS|

Telegram group : t.me/joinchat/...
contact me on Gmail at [e-mail]
contact me on Instagram at : / shraavya_katkuri
Thank you for 1000 subscribers video: about me • THANK YOU FOR 1000 SUB...
Design Patterns Playlist: • #1 Introduction to Des...
Infosys Recruitment 2021: • INFOSYS 2021 RECRUITME...
Cloud Computing Playlist: • Cloud Storage from LAN...
Mobile Computing Playlist: • #1 Introduction to Mob...
Data Warehouse & Data Mining Playlist: • #1. Introduction To Da...
All Placement related videos : • TCS NQT JANUARY 2021 I...
Cryptography & Network Security: • #1 Introduction & Need...
Managerial / Business Economics & Financial Analysis: • #35 Double Entry Book ...
Operating Systems Playlist : • #1 Introduction and ob...
Aptitude Playlist : • #1 Time & work part-1
Grade 10 math chapter-6 (TRIANGLES): • #15 Triangles- Introdu...
Grade 8 science chapter-4 (Metals & Non-Metals): • #17 Displacement React...
Grade 10 math chapter -8 (Introduction to Trigonometry): • #12 Introduction To Tr...
Grade 8 science chapter-11 (Force & Pressure): • #12 Force and pressure...
Grade 8 math (NCERT): • #1 Introduction to rat...
Grade 10 Math(NCERT): • #1 Real number definit...
Grade 8 Science (NCERT): • #1 Crop Production and...

[@varshar7483]

Thanks a lottttttttt 🙏🙏 You have taught so much in exam point of view ,, I have learned everything from you and wrote the exam thanks a lottttttttt

[@sathish9042]

Your explanations are better than guides and notes .Thank you so much mam.

[@kunalsoni7681]

your notes are very clear and easy to understand. And the way you teach is fabulous ☺️💯💫

[@diwakar2501]

4:38 ed/mod pie(n)=1 this is how it should be right

[@RahulLour]

we know that 1 mod(n) = 1/1 mod(n) OR 1 mod(n)=(1 mod(n))^-1 == 1 , thus ed= 1 mod pi(n) OR ed = 1/1 mod pi(n) , as a result ed mod pi(n) = 1

[@ananthan7355]

bro just consider e^-1(fi(n)) as an entity and move it to the other side , that was a mistake from the video

[@rishidiwute3604]

kudos ! wrapped under some minutes ! also M is not number of digits Its is decimal representation of string message. (Cryptography and NS by w stalling)

[@adityaky5427]

How you taken Ed=1modΦ(n) as Ed modΦ(n)=1

[@raomubashir3976]

how?

[@VijayKumar-hn2hx]

@@raomubashir3976 actually the formula is edmod(n)=1,she took wrong in video

[@raomubashir3976]

@@VijayKumar-hn2hx right but now it's too late to talk about this , cuz i gave its paper yesterday 😅

[@VijayKumar-hn2hx]

@@raomubashir3976 🤣ok

[@amigosters6381]

Ed=1modn means edmodn=1
That is ed divides by n then get remainder is one

[@roshithborra4713]

very nice explanation and it's very easy to understand for only single time.......

[@spkumar.17]

Its osm😁😁😁
Thanks for helping 🙂🙂

[@TroubleFreevideos]

You’re welcome

[@surajr4757]

1:50, those two numbers must be prime numbers

[@AjayYadav-dv2vs]

That is awesome series of Cryptography thank you

[@ayushiumbarkar3068]

Your way of explaining is too good
Thanks a lot

[@vajidkhan1131]

Time complexity and space complexity of RSA algorithm, where this algorithm is used

[@maazaslam7455]

The calculation for 'd' doesen't work if we have large values for n, and phi of n, As it just becomes a Brute Forcing by counting each mod upto idk a thousand before until we get the correct value of 'n' Thats basically what my instructor replied with

[@akhil__1998]

ed=mod pie(n)
edmod pie(n)=1
?

[@akhil__1998]

?

[@Fs99al]

Extended Euclidean algorithm

[@eduatm5222]

Madam, thanks a lot for ur kind clear explanation.....AthmaRam

[@devangmathur5809]

We have to take 2 prime numbers in the starting.

[@mohammadamanalimyzada1462]

p and q are large primes for better security

[@tanvipandya3353]

Ma'am, lectures are so nice. Please guide how can I get these notes?

[@gauravsharma5584]

Best video i watched so far for this topic. Thank you

[@sherlyj282]

Excellently teaching mam and like ur flow of speaking and understood very well mam thank you very much

[@placementpreparationformnc2408]

Love you for your explanation ❤️😇😘

[@placementpreparationformnc2408]

Hmmm

[@novicecoder5753]

Explanation is good but there is no theory about the concept in video please include it in future videos

[@jesuschrist77501]

Thank you...well defined class lecture with simple communication

[@ram-dg2or]

Thanks for your explanation
Could you please explain how to implement it practically

[@aswinmanmathans6837]

P and Q should be prime ..pin

[@Bajrang9033]

Tank you mam for your good explanation

[@mohammedfouzan4798]

Your explanation of algorithm is good!. But, the question every learner should ask is how is decryption key sent over the internet to the receiver so that he can decrypt and read the message ? All i say is just don't blindly understand the algorithm without knowing the use of it.

[@yashpatil3006]

Thankyou so much ma'am. All my doubts are getting cleared a day before exam :)

[@KarthiKeyan-rf6bc]

You are taking so clear

[@zeeshanhaider3953]

Tanks a lot ma'am
U clear all my doubts 🥰🥰

[@jashu2426]

Your explanation way is very good to understand 🎉

[@vikaskadimani2158]

hlo mam u have explained the things so easily and it was very helpfull to me mam and so for that thank you mam.

[@TroubleFreevideos]

Most welcome 😊

[@_AkeelAhmad_wani]

ohh maam what a cool way of explaining

[@keshavgupta2647]

how do we assume m in this case?
by hit and trial?
won't it take a lot of time and calculations?

[@yashkalia2311]

Any value works which satisfies the condition

[@VENOM-yt3ft]

Add Chinese remainder theorem in the cns playlists

[@shubhampatel3494]

how did she get c=4

[@ANILKUMAR-yw7zw]

Wow so easily u explained 👏👏👍

[@Ajayrathnam_P]

We have tomorrow exam
I watched all your algorithm video
But for me it’s hard to remember which steps will come for which algorithm
RSA and Elgamal have same 3 steps
So it’s just collapsing
Can you upload a one last video
How to memorise and keep in mind for FOR THESE ALGORITHM

[@Ajayrathnam_P]

Upload soon mam waiting for your VIDEO

[@HarshaSN]

Thank you it's very clear

[@bhavyakasa8231]

Tquuu mam

[@janardhanreddyboyalla2941]

why edmod(fi(n))=1?

[@Krishna-z1g5r]

Superb Explaination 🔥🔥🔥

[@riddhishukla5465]

don't understand at the time 4:25 .. plz tell me in deep

[@MRPTrader7]

Thanks a lot

[@nirmalabigimalla3]

mam as you said in previous videos block cipher is symetric but here you said RSA is block cipher so it must be symetric but why RSA is asymetric

[@archanak.h9111]

Tq so much mam

[@kistareddy5361]

thanks a lot mam

[@youtuber9571]

Can you please explain elliptic curve cryptography

[@ashwinunnikrishnan6689]

great video

[@syamalas9199]

Thaks a lot sister u helped me a lot for exam .
Tqsm ❤️u

[@AbhinandBhavan]

Should p and q be prime or co prime or not?

[@CSSakthivelm]

prime

[@tadelasanthoshi9037]

If we take any values of the M value the answer will be same ....... If not same the answer will be wrong....

[@CS_Student_raj]

I think all are using same example only
What is trick for taking e value medam

[@lakshmanikkurthi567]

Simple and easy ❤

[@VISHALSINGH-ur6rl]

Thanks a lot
your way of explaining is too good
Thanks a lot

[@burugukrishnamurthy4832]

Hi madam. I have watched yours FLAT subject videos. I have passed that subject.

[@kittuthegreat1819]

can you tell me what are the key distribution approaches for method authentication in cyber security ? i have exam.. is it the same you are explaining ? symmetric and asymmetric any other approches?

[@premsagarvangara759]

Thank you ma'am 👍

[@rapture_05_14]

Nice explanation

[@sruthim2542]

What is gcd here?

[@bibekdevkota2281]

thank you so much sister

[@siddhu8558]

4:24 how did mod⌀(n) come to LHS?

[@aryansinvasion]

same question

[@onestepawarenesshummanity6360]

How to calculate 31 power 7mod 33 c=4 ?please suggest me

[@funfilm7615]

Calculator

[@ADITYA_1303]

Thank you 🙏

[@saimanikantaragi614]

Plz complete the playlist soon

[@prathamgupta6973]

It is large prime numbers in the beginning of the video.

[@vikram0411]

thanks for helping us sis...it's very useful for us..

[@prajwalbhasme5317]

How to calculate GCD?

[@anupriya5861]

How do we calculate 31 power 7 mod 33? Plz help me

[@abhijitnayak.8733]

Very much useful. 🥲

[@travelingnomad8873]

how to do MITM in cryptool ???.. please make video on it!!.?

[@shashi_speaks]

u need to explain how to do calculator, like us we don't know how to do in calculator

[@ashutoshpathak1387]

GCD of 2 numbers = 1 means they are co-prime. GCD OF 20 AND 6 is not 1. Greatest common divider of 20 and 6 is 2. .... you said we can use 6, coz 6 is not a factor of 20. You are confusing factor with GCD. LOL 3:40 "YOU CANNOT TAKE 4 correct, coz gcd of 4 and 20 is 4, you cannot take 5 correct coz gcd of 5 and 20 is 5, you can take 6 LMAO, NO YOU CAN'T TAKE 6, coz although GCD OF 6 AND 20 IS NOT 6 (like 4 and 5 prev), it still is 2, AND 2 IS NOT EQUAL TO 1.

[@rithikasunkara9074]

Is that prime large number or only large number youu have not given clarity mam can u tell

[@akshayhegde6886]

thank u mam,that's so helpfull

[@tsreenutsreenu1543]

Your explanation is super mam🫂🫂🫂

[@rohityt9714]

actually d is congurent not equal

[@sowjanyachapala3971]

Can u please share the vedio of fermats & Euler's theorem in CNS by tomorrow

[@akashmaurya5342]

agar yeh que 29 ka aata h or isme encryption or decryption galat ho baaki D tak shi to kitne number milege?

[@abrarbardolia169]

Thanks you ma'am

[@subathra7701]

If we take e=3 it doesn't give correct answer

[@sadiq234]

Thank you mam❤

[@danielpauljcs]

Tq so much yar👍😀

[@romeogurung1556]

encrypt the word "retaliate" and then decrypt it madam

[@sireeshaBirusu]

full stack development jntua syllabus wise vedios share cheyandi మమ,

[@MUTHURAJPECETEC]

Thank you mam

[@divyaanshuagrawal3383]

Thanks mam!

[@harivardhanv278]

whether it is prime or not explain??

[@ffstories1m801]

Yes, prime

[@yyndsai]

you told that you wll say they are prime or not at the end of the video, but you didn't said??

[@Aman8957]

Thanks

[@Raistar_172]

Can we choose m=2 ,In encryption ?

[@Noobgamer-jd1sb]

Please note. Private key in RSA is only d not d, n

[@Vk_status1]

Nice mam but I have some doubts

[@darsanan4017]

Nizz ✨️

[@varshavarsha1466]

thank you soooooooo much......

[@KQACSaleem]

Tq mam 🎉

[@harshavarthan3084]

It is not a block cypher algorithm

[@simple1-st7pc]

TQ 😁

[@aishwaryamahesh4308]

can you make a video how to slove large power number in scienctific calculator like 234^2345

[@core_cse]

i think it is not possible to solve using scientific calculator

[@NaveenReddy-zk7of]

Who will say what is GCd means ?