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?
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.
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 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
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
your notes are very clear and easy to understand. And the way you teach is fabulous ☺️💯💫
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)
Your way of explaining is too good
Thanks a lot
That is awesome series of Cryptography thank you
Its osm😁😁😁
Thanks for helping 🙂🙂
You’re welcome
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
very nice explanation and it's very easy to understand for only single time.......
Madam, thanks a lot for ur kind clear explanation.....AthmaRam
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
Time complexity and space complexity of RSA algorithm, where this algorithm is used
1:50, those two numbers must be prime numbers
ed=mod pie(n)
edmod pie(n)=1
?
?
Extended Euclidean algorithm
Best video i watched so far for this topic. Thank you
very explicit thanks
We have to take 2 prime numbers in the starting.
3:42 gcd of 20 and 6 is 2 so you can't take 6
Excellently teaching mam and like ur flow of speaking and understood very well mam thank you very much
p and q are large primes for better security
Ma'am, lectures are so nice. Please guide how can I get these notes?
Thank you...well defined class lecture with simple communication
ohh maam what a cool way of explaining
You are taking so clear
Superb Explaination 🔥🔥🔥
Thanks for your explanation
Could you please explain how to implement it practically
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
don't understand at the time 4:25 .. plz tell me in deep
Should p and q be prime or co prime or not?
prime
Wow so easily u explained 👏👏👍
Your explanation way is very good to understand 🎉
Thankyou so much ma'am. All my doubts are getting cleared a day before exam :)
Thank you it's very clear
how did she get c=4
4:24 how did mod⌀(n) come to LHS?
same question
U first wrote d=e^-1modphy(n)
But by sub e=-1
Phy(n)=20
We get d =140
why edmod(fi(n))=1?
Tanks a lot ma'am
U clear all my doubts 🥰🥰
Explanation is good but there is no theory about the concept in video please include it in future videos
Love you for your explanation ❤️😇😘
Hmmm
good explanation
Add Chinese remainder theorem in the cns playlists
P and Q should be prime ..pin
If we take any values of the M value the answer will be same ....... If not same the answer will be wrong....
Simple and easy ❤
How to calculate GCD?
Can you please explain elliptic curve cryptography
whether it is prime or not explain??
Yes, prime
Tank you mam for your good explanation
Thanks a lot
your way of explaining is too good
Thanks a lot
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 ❤
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 😊
Any tricks there ..to find d value faster
d=(∅n + 1)/e
We can easily find
Hi
Thaks a lot sister u helped me a lot for exam .
Tqsm ❤️u
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?
Nice explanation
Hi madam. I have watched yours FLAT subject videos. I have passed that subject.
❤❤ thank you so much
Can we choose m=2 ,In encryption ?
Thank you ma'am 👍
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.
It is large prime numbers in the beginning of the video.
I love your voice mam ❤❤
What is gcd here?
How do we calculate 31 power 7 mod 33? Plz help me
great video
Plz complete the playlist soon
whether the value of encryption and decryption can be same
thanks for helping us sis...it's very useful for us..
actually d is congurent not equal
Nizz ✨️
How to calculate 31 power 7mod 33 c=4 ?please suggest me
Calculator
how to do MITM in cryptool ???.. please make video on it!!.?
thank you so much sister
thanks a lot mam
encrypt the word "retaliate" and then decrypt it madam
Your explanation is super mam🫂🫂🫂
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
thank u mam,that's so helpfull
How I calculate modular in calculator
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.
Can u please share the vedio of fermats & Euler's theorem in CNS by tomorrow
Is that prime large number or only large number youu have not given clarity mam can u tell
u need to explain how to do calculator, like us we don't know how to do in calculator
agar yeh que 29 ka aata h or isme encryption or decryption galat ho baaki D tak shi to kitne number milege?
Nice mam but I have some doubts
How is c=4??
Tq mam 🎉
Thank you 😊
Mam what about 'RC5' algorithm?
How you let the value 31
can u tell how to calculate mod in calc
I think all are using same example only
What is trick for taking e value medam
Please note. Private key in RSA is only d not d, n
e must be a co-prime of phi(n)
TQ 😁
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)
Who will say what is GCd means ?
Very much useful. 🥲