#28. RSA Algorithm - Asymmetric key cryptography |CNS|
Vložit
- čas přidán 12. 11. 2021
- Telegram group : t.me/joinchat/G7ZZ_SsFfcNiMTA9
contact me on Gmail at shraavyareddy810@gmail.com
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...
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
Your explanations are better than guides and notes .Thank you so much mam.
your notes are very clear and easy to understand. And the way you teach is fabulous ☺️💯💫
Excellently teaching mam and like ur flow of speaking and understood very well mam thank you very much
Your way of explaining is too good
Thanks a lot
That is awesome series of Cryptography thank you
Best video i watched so far for this topic. Thank you
4:38 ed/mod pie(n)=1 this is how it should be right
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
bro just consider e^-1(fi(n)) as an entity and move it to the other side , that was a mistake from the video
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)
Its osm😁😁😁
Thanks for helping 🙂🙂
You’re welcome
very nice explanation and it's very easy to understand for only single time.......
Thanks a lot
your way of explaining is too good
Thanks a lot
Thank you...well defined class lecture with simple communication
Wow so easily u explained 👏👏👍
ohh maam what a cool way of explaining
Madam, thanks a lot for ur kind clear explanation.....AthmaRam
Thankyou so much ma'am. All my doubts are getting cleared a day before exam :)
Tanks a lot ma'am
U clear all my doubts 🥰🥰
thanks for helping us sis...it's very useful for us..
Superb Explaination 🔥🔥🔥
Tank you mam for your good explanation
Your explanation way is very good to understand 🎉
You are taking so clear
Thanks to your clear explanation mam
Love you for your explanation ❤️😇😘
Hmmm
Simple and easy ❤
Thaks a lot sister u helped me a lot for exam .
Tqsm ❤️u
You saved me a day!
Ma'am, lectures are so nice. Please guide how can I get these notes?
Thank you it's very clear
Thanks for your explanation
Could you please explain how to implement it practically
Nice explanation
thank u mam,that's so helpfull
Thanks a lot
whether the value of encryption and decryption can be same
Thank you ma'am 👍
p and q are large primes for better security
how do we assume m in this case?
by hit and trial?
won't it take a lot of time and calculations?
Any value works which satisfies the condition
thanks a lot mam
Tq so much mam
great video
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?
Thanku ma'am ♥️
How you taken Ed=1modΦ(n) as Ed modΦ(n)=1
how?
@@raomubashir3976 actually the formula is edmod(n)=1,she took wrong in video
@@VijayKumar-hn2hx right but now it's too late to talk about this , cuz i gave its paper yesterday 😅
@@raomubashir3976 🤣ok
Ed=1modn means edmodn=1
That is ed divides by n then get remainder is one
Thanks you ma'am
Thanks aa lot mam
What is gcd here?
Thank you mam❤
Thank you 😊
how did she get c=4
Thanks mam!
hlo mam u have explained the things so easily and it was very helpfull to me mam and so for that thank you mam.
Most welcome 😊
Thank you mam
Tq so much yar👍😀
Super madam
thank you
Should p and q be prime or co prime or not?
prime
Time complexity and space complexity of RSA algorithm, where this algorithm is used
thank you so much sister
ed=mod pie(n)
edmod pie(n)=1
?
?
Extended Euclidean algorithm
Can we choose m=2 ,In encryption ?
why edmod(fi(n))=1?
Thanks a Lot
Can you please explain elliptic curve cryptography
thank you soooooooo much......
We have to take 2 prime numbers in the starting.
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
agar yeh que 29 ka aata h or isme encryption or decryption galat ho baaki D tak shi to kitne number milege?
super akka nuvvu
How you let the value 31
Super mam
Thank ü mam :)
👍
Nizz ✨️
thankss :)
Hi madam. I have watched yours FLAT subject videos. I have passed that subject.
Is that prime large number or only large number youu have not given clarity mam can u tell
Mam what about 'RC5' algorithm?
Thank you 🙏
don't understand at the time 4:25 .. plz tell me in deep
Killer 🔥
mod means remainder??
Tq mam 🎉
P and q are prime numbers or natural numbers
Tquuu mam
Thanks
how to do mod in the calculator
How I calculate modular in calculator
Can u please share the vedio of fermats & Euler's theorem in CNS by tomorrow
How to calculate GCD?
Explanation is good but there is no theory about the concept in video please include it in future videos
How do we calculate 31 power 7 mod 33? Plz help me
Plz complete the playlist soon
you told that you wll say they are prime or not at the end of the video, but you didn't said??
can u tell how to calculate mod in calc
TQ 😁
what to write sha 512 for me tomorrow exam'
Add Chinese remainder theorem in the cns playlists
1:50, those two numbers must be prime numbers
Mam you have take the E value as 7, but we can take any value I. e which should be lies between 1-20 I mean 8,9,6,5... Is it correct?
gcd should be 1 between e and 20(pi)n)