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)
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
For mod if u are do example 7mod3 First do 7/3=2.33333.. Then do 2.333-2=0.33333.. Then multiply it with the rhs i.e 3 You will get 1 Do the same for your problem
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?
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.
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.
Your explanations are better than guides and notes .Thank you so much mam.
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 notes are very clear and easy to understand. And the way you teach is fabulous ☺️💯💫
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
Madam, thanks a lot for ur kind clear explanation.....AthmaRam
very nice explanation and it's very easy to understand for only single time.......
very explicit thanks
Time complexity and space complexity of RSA algorithm, where this algorithm is used
Your way of explaining is too good
Thanks a lot
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
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
That is awesome series of Cryptography thank you
Best video i watched so far for this topic. Thank you
3:42 gcd of 20 and 6 is 2 so you can't take 6
how did you calculate the huge cipher text value on a calculator and how did you do mod and all that stuff?
For mod if u are do example 7mod3
First do 7/3=2.33333..
Then do 2.333-2=0.33333..
Then multiply it with the rhs i.e 3
You will get 1
Do the same for your problem
@AmmaraIqbal-y9e thanks I actually figured this out on my and my exam's already done.
Thanks anyway ❤
You are taking so clear
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...well defined class lecture with simple communication
p and q are large primes for better security
1:50, those two numbers must be prime numbers
ed=mod pie(n)
edmod pie(n)=1
?
?
Extended Euclidean algorithm
Excellently teaching mam and like ur flow of speaking and understood very well mam thank you very much
Any tricks there ..to find d value faster
d=(∅n + 1)/e
We can easily find
Hi
U first wrote d=e^-1modphy(n)
But by sub e=-1
Phy(n)=20
We get d =140
We have to take 2 prime numbers in the starting.
Superb Explaination 🔥🔥🔥
Your explanation way is very good to understand 🎉
❤❤ thank you so much
Thank you it's very clear
Thankyou so much ma'am. All my doubts are getting cleared a day before exam :)
good explanation
I love your voice mam ❤❤
Thaks a lot sister u helped me a lot for exam .
Tqsm ❤️u
How do we calculate 31 power 7 mod 33? Plz help me
Love you for your explanation ❤️😇😘
Hmmm
Tanks a lot ma'am
U clear all my doubts 🥰🥰
Wow so easily u explained 👏👏👍
ohh maam what a cool way of explaining
4:24 how did mod⌀(n) come to LHS?
same question
What is gcd here?
how did she get c=4
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?
can u tell how to calculate mod in calc
How to calculate GCD?
Simple and easy ❤
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
Should p and q be prime or co prime or not?
prime
why edmod(fi(n))=1?
How I calculate modular in calculator
don't understand at the time 4:25 .. plz tell me in deep
whether it is prime or not explain??
Yes, prime
Nice explanation
Can we choose m=2 ,In encryption ?
Hi madam. I have watched yours FLAT subject videos. I have passed that subject.
How you let the value 31
P and Q should be prime ..pin
How e is 7 even 3 also have gcd will come as one
Thanks for your explanation
Could you please explain how to implement it practically
whether the value of encryption and decryption can be same
Thank you ma'am 👍
how to do MITM in cryptool ???.. please make video on it!!.?
how to find gcd vole (20,e)
great video
Tank you mam for your good explanation
It is large prime numbers in the beginning of the video.
How to calculate 31 power 7mod 33 c=4 ?please suggest me
Calculator
How is c=4??
how to do mod in the calculator
thank you so much sister
Ma'am, lectures are so nice. Please guide how can I get these notes?
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.
If we take any values of the M value the answer will be same ....... If not same the answer will be wrong....
R u Kannadiga
what to write sha 512 for me tomorrow exam'
actually d is congurent not equal
Add Chinese remainder theorem in the cns playlists
what to write sha 512
Thanks a lot
your way of explaining is too good
Thanks a lot
Explanation is good but there is no theory about the concept in video please include it in future videos
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.
thanks for helping us sis...it's very useful for us..
thank u mam,that's so helpfull
Your explanation is super mam🫂🫂🫂
Can you please explain elliptic curve cryptography
Plz complete the playlist soon
Who will say what is GCd means ?
Nizz ✨️
Please note. Private key in RSA is only d not d, n
Can u please share the vedio of fermats & Euler's theorem in CNS by tomorrow
mod means remainder??
Yes
what is gcd
Greatest common divisor
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
Is that prime large number or only large number youu have not given clarity mam can u tell
can you make a video how to slove large power number in scienctific calculator like 234^2345
i think it is not possible to solve using scientific calculator
31 power 7 how did u do mod in calculator
Example- 34mod 33
Do
1) 34 divided by 33 . Remainder =1 is the answer.
34mod33=1
Mam what about 'RC5' algorithm?
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