hi califano thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
@@shahrozshk2175 use this formula --> d*e= 1 + [k* pfi(n)] d=[1+ {k * pfi(n) } ]/ e . now keep substituting k=0,1,2,3,4....n and calculate d for every iteration, if d value is decimal, ignore it, if its whole number, then that's your value of d.
Although I'm a cybersecurity engineer, I still watch your videos because of your explanation. It's easy and simple , you have never complicated the subject. It's always a revision to me sandip. Kudos to you for the great work. Many thanks!!!!
hi deepak thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Hai sir i am pavan kumar karumanchi now i am studying ms in italy...your videos are so helpful for me in subject of network security...any you awesome sir
Sir you have helped me a lot sir during my exams time. Your explonation is very goood and clear. Keep maintian that sir. You are one of the best teacher in my study career. I was scared about this subject and i found you on youtube. Now i learned lot of subject. Thank you very much sir.
hi Sekhar thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
hi devendra thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Excellent video. My only suggestion is to use a different example so the encryption and decryption keys have a different value and so the plaintext and ciphertext also have different values. That said, excellent video and the only one that clearly points out there are multiple possible encryption keys.
hi habibullah thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Doubt sir:-Can we assume bigger d values following the mod rule as our wish for better decryption or is it must that we should take lower values ,i mean to ask is there any constraint for d values just like e ?
But it is very easy to find private key if we know the public key right! As I know n I will find the two primes p and q. Finding p and q is easy because there will be only four factors for n(namely 1,n,p,q). then I will find t=(p-1)*(q-1). As I know e, I just have to select a d such that e*d=k*t+1, where k is any natural number(mostly k=1 as higher values of k results in very high values of c.)
Hey man, you are a life saver, the video is really good. Thanks for that. But I have a question at 20:10. Why do you choose m=4 and not any other value for m?
Reālly pretty great sir. And .1 small.doubt.tat in examz .we can take dis example sir.bcz . according.to u .it safe to prefer larger prime no. We should take .bt it's no matter .if we take small.no.to calculate. I mean .it is valid example for.examz if thy ask to ... illustrate any valid example of RSA Algorithm sir....
hi Esmail thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Very good explanation, Sir I want to know how to calculate d when we take p=7 and q=17 we get d*5mod96=1 how can we get d easily in this case, is their any shortcut to calculate d. Also how to calculate C=6^5mod119 . Is their any shortcut to calculate large powers like this.Thanks a lot in advance for you reply.
hi shyju i found the procedure and send me an email to askme.selflearning@gmail.com so that i will send it as a reply to your mail. thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Thank you for the video, I have a question Sir is it possible to have the same encryption & decryption key in RSA? also is it possible for ciphertext & plaintext to be 0?
Really I understood this subject very well by ur explanation .I have one doubt what is the purpose of finding Euler's totient which u have done example .direct we can substitute the pand q value we ll get n value y should we go for tat table
Well sir , in one example, it came as d * 5 mod 96 = 1...... In this case, trial and error would be too hectic. Any shortcut? How to find d by a better approach here??
hi srihari thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
If my plaintext = cryptography then how can we cipher it? means what should be selected as M? weather we will select M as C ASCII, R ASCII, Y ASCII etc then convert it or no.of alphabets in plaintext which is 12 here.. answer please
hi thanks for watching my sessions if the primes are small numbers then algorithm can be attack by guessing the values. that is the main weakness of the algorithm.
thank you, but I have a question .. why you chose e = 3 what if we say its 5 or 7 as you said ?! in that case our answer will be wrong ?! or there is an optimal way to choose e among all that numbers..
Apply the mathematical foundations of RSA algorithm. Perform encryption decryption for the following data: P=17, q=7, e=5, n=119, message=”6” I have doubt in (d value) in this problem sir. Can u please help me
thank you sir, I understood the procedure but still not able to follow why this algorithm will always work, which means how do you gurantee that the plain text decrypted at receiver's side will always be the plain text. I can't understand why it will be true in every case. can you tell explain the validity of RSA mathematically..??
hi maqsood The value of Eulers Totient Function (pie) is the count of all numbers from 1 to n-1 without the factors of n and themselves. so here we have to consider 1 also. Ex: if we need to calculate pie(6) pie(6)={1,5}=2 ( here 2 and 3 are the factors and we have to avoid the multiples of 2 and 3 also) pie(10)={1,3,7}=3 ( here 2 and 5 are the factors and we have to avoid the multiples of 2 and 5 also) pie(5)={1,2,3,4}=4 hope your doubt has been clarified.
hi pramod here we have to find e value for encryption by using GCD(e,pi(n)) and d value for decryption by substituting the formula which is given in the video. Hope your doubt has been clarified.
hi satish thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
suppose, we are encrypting a message with m=10 and e=13 and n=221. so, cipher text would be, ct = m^e * mod(n) ct = 10^13 * mod(221) so, for large numbers, i am unable to find the value of cipher text using calculator. So, can you please suggest us a method a to do so?
Hey sir, Can you help me in this task that i have or suggest any book that explain these thing or any tutorial. My task is this: Syntax:ds create-user Creates a public/private RSA pair with the names.xml and .pub.xml within the keys key directory. The keys directory is a folder that holds public and private keys.This directory is stored somewhere as desired.It can be relative to the executable file or it can be at home or anywhere so it will suit you.So the created files will be keys /.xml and keys/.pub.xml.You are not obliged to save the keys in xml format.Keys can also be saved as a file tree. The size of the key is optional.Names should contain only the symbols A-Z,a-z,0-9 and_.Names must not contain spaces.
Nice Video Sir, Greatly explained. I have a small request. could u pls make a video on berlekamp massey algorithm. I couldn't find any video pertaining to it anywhere on google. This topic is there in our cryptography syllabus and we have got an exam in the coming week. could you please make a video on it by giving an example as well.
hi chandan thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
man you are literally saving me, i'm having a university test next week and i understood more from you than from my book. Thank you very much!
hi califano
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
This reminds me of a 9gag instagram post. xD
How to calculate d for large nmbrs
@@shahrozshk2175
use this formula --> d*e= 1 + [k* pfi(n)]
d=[1+ {k * pfi(n) } ]/ e .
now keep substituting k=0,1,2,3,4....n and calculate d for every iteration, if d value is decimal, ignore it, if its whole number, then that's your value of d.
@@sundeepsaradhi how to contact you sir ?
Although I'm a cybersecurity engineer, I still watch your videos because of your explanation. It's easy and simple , you have never complicated the subject. It's always a revision to me sandip. Kudos to you for the great work. Many thanks!!!!
thank you sir, love from Zimbabwe, preparing for computer security exam, great explanation
hi kuda
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
I have seen so many of your videos thanks for your explanation in a friendly manner. Best teacher ever I had
this is the easiest nd simplest way to explain the concept.....tqu sir ......its very useful to me ....
you are the teacher that i never had. thank you so much sir.
Thanks a lot sir. I have my university exams tomorrow and u proved to be a great help.
Simple Approach and Straight to the point. Well explained Sir !!
Sir, I am your fan.You are doing a great job. I have exam day after tomorrow and you have saved my life.
This the best explanation I found on RUclips. Thank you
hi deepak
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Thank you very much sir,. I was about to ignore this topic before watching this video, as i felt it was really tough... Once again thanks a lot sir❤️
Hai sir i am pavan kumar karumanchi now i am studying ms in italy...your videos are so helpful for me in subject of network security...any you awesome sir
Thank you so much sir, tomorrow I have my exam and this video helped a lot. You explain very nicely
Sir you have helped me a lot sir during my exams time. Your explonation is very goood and clear. Keep maintian that sir. You are one of the best teacher in my study career. I was scared about this subject and i found you on youtube. Now i learned lot of subject. Thank you very much sir.
Sooper, clear and detailed explanation. Keep doing such videos, very helpful to all
hi Sekhar
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
Sir,i wrote in this question in my exams also,,,it is very easy after listen your lecture........superrr lecture sir
Awesome Explanation Sir! Won't find a better explanation anywhere!
I respect your patience and good explanation
Chala clarity ga explain chesaru sir thank you so much sir
Because of u I did my xam well today👍, Thanks alot😊😊😊
Very Good Sir, Many Thanks for your teaching and your knowledge. Harry, Ireland
Thanks for uploading this!
Your playlist is pretty good as well!
sir thanks for the video!Am using your video for my exam preparation
Can't thank you enough .... Great lectures , wish you all the best.
Excellent presentation, very lucid, U r simply superb sir
Tq sir your explanation is awesome , got cleared in rsa
Thank you and it help to understand the algorithm which I need to do some assignment from university
coming back to recall memory of rsa calculation for upcoming exam :)
Awesome explanation. Really helped in my test. Thanks very much
Save lot of time and thanks for detailed information you going to right way.....
Thank you so much sir.... You are a excellent lecturer....
hi devendra
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
thank you sir !. you are the best teacher
Thank you so much for making this simple ! Respect+
If I pass my exams tomorrow, you are my god.
All the very best for your exams
Excellent video. My only suggestion is to use a different example so the encryption and decryption keys have a different value and so the plaintext and ciphertext also have different values.
That said, excellent video and the only one that clearly points out there are multiple possible encryption keys.
thank you sir it was very good tutorial about network security
hi habibullah
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
thank you sir making such videos those all videos are useful to us
very good explanation, thank you very much sir!!!!
Excellent teaching sir
Tq sir...very gud explanation..understood clearly
amazing explanation. thank you.
Doubt sir:-Can we assume bigger d values following the mod rule as our wish for better decryption or is it must that we should take lower values ,i mean to ask is there any constraint for d values just like e ?
You can assume on your own there is no constraint for selecting d value
Sir, you really saved my life!! Eager to see more......keep going
Very gud explanation sir .....tq sir
last minute saviour. Thank you. :)
Hi Shrestha
Thank you for your support towards our channel share our channel with your friends and keep following our channel.
Thank you so much for this detailed explanation sir
I will decompose the RSA of any complexity into multipliers. Fast and not expensive.
But it is very easy to find private key if we know the public key right! As I know n I will find the two primes p and q. Finding p and q is easy because there will be only four factors for n(namely 1,n,p,q). then I will find t=(p-1)*(q-1). As I know e, I just have to select a d such that e*d=k*t+1, where k is any natural number(mostly k=1 as higher values of k results in very high values of c.)
Very efficient Teacher
thank you
Hey man, you are a life saver, the video is really good. Thanks for that.
But I have a question at 20:10. Why do you choose m=4 and not any other value for m?
Hi
Here m is plain text and we can have any value and I took as 4.
@@sundeepsaradhi Sir if we have plain text as alphabets, should we consider the ascii values of that alphabets.
I wanted asking this because got confused if its just an arbitrary value
Very well explained
Reālly pretty great sir.
And .1 small.doubt.tat in examz .we can take dis example sir.bcz . according.to u .it safe to prefer larger prime no. We should take .bt it's no matter .if we take small.no.to calculate. I mean .it is valid example for.examz if thy ask to ... illustrate any valid example of RSA Algorithm sir....
Nice explaination sir
Thank you sir! Really helpful for cns exam
This is really helpful...great work sir..thank you..
hi Anwar
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Nice explanation Sir
hi Esmail
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
Great Explanation. Thanks.
thank you so much! you did a great job!
Great job sir.
WELL EXPLAINED SIR
WILL YOU HAVE LECTURE ON ECC (ELIPTIC CRYPTGRAPHY CURVE)
sir you are great, we are thankful to you,but you should reduce duration of tutorials
super explaination sir
Great explanation 👌
HI SABER
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
You saved my 15 marks for tomorrow's exam
thanks sir for such good explanation
nice lecture sir
Very good explanation, Sir I want to know how to calculate d when we take p=7 and q=17 we get d*5mod96=1 how can we get d easily in this case, is their any shortcut to calculate d. Also how to calculate C=6^5mod119 . Is their any shortcut to calculate large powers like this.Thanks a lot in advance for you reply.
hi shyju
i found the procedure and send me an email to askme.selflearning@gmail.com so that i will send it as a reply to your mail.
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
I put in 1.5 playback speed it was really good at last moment
Thank you for the video, I have a question Sir is it possible to have the same encryption & decryption key in RSA?
also is it possible for ciphertext & plaintext to be 0?
Really I understood this subject very well by ur explanation .I have one doubt what is the purpose of finding Euler's totient which u have done example .direct we can substitute the pand q value we ll get n value y should we go for tat table
Well explained! Keep up the good work!
thank you very much sir
Thanq sir.....good teaching...
hi madan
thanks for watching my sessions and your interest towards our channel.
superb teachng sir
Well sir , in one example, it came as d * 5 mod 96 = 1......
In this case, trial and error would be too hectic. Any shortcut? How to find d by a better approach here??
77
Use multiplications of 96 to predict d's value closer to that multiplications. You can get d value a bit faster
Why did we consider plain text msg as 4.
Sir can you explain that how gcd(e,fi(n))=1for 3,5,7 and why you have choosen 3 and how you choose 3,5 and 7 only
nice explanation sir thank u
hi srihari
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
If my plaintext = cryptography then how can we cipher it? means what should be selected as M?
weather we will select M as C ASCII, R ASCII, Y ASCII etc then convert it or no.of alphabets in plaintext which is 12 here..
answer please
Thank you sir I just have a question what is the weakness of rsa cryptosystem how we can attack it (assuming the prime numbers are large) ?
hi
thanks for watching my sessions
if the primes are small numbers then algorithm can be attack by guessing the values.
that is the main weakness of the algorithm.
Hi,
One weakness can be the uniqueness of the Random numbers generated(prime numbers).
thank you, but I have a question .. why you chose e = 3 what if we say its 5 or 7 as you said ?! in that case our answer will be wrong ?! or there is an optimal way to choose e among all that numbers..
Apply the mathematical foundations of RSA algorithm. Perform encryption
decryption for the following data: P=17, q=7, e=5, n=119, message=”6”
I have doubt in (d value) in this problem sir. Can u please help me
thank you sir, I understood the procedure but still not able to follow why this algorithm will always work, which means how do you gurantee that the plain text decrypted at receiver's side will always be the plain text. I can't understand why it will be true in every case. can you tell explain the validity of RSA mathematically..??
thanks, sir, for the detailed explanation. I have a question about yonus torsion function. (can we get (1) as a divider factor. if No then why?
hi maqsood
The value of Eulers Totient Function (pie) is the count of all numbers from 1 to n-1 without the factors of n and themselves.
so here we have to consider 1 also.
Ex: if we need to calculate pie(6)
pie(6)={1,5}=2 ( here 2 and 3 are the factors and we have to avoid the multiples of 2 and 3 also)
pie(10)={1,3,7}=3 ( here 2 and 5 are the factors and we have to avoid the multiples of 2 and 5 also)
pie(5)={1,2,3,4}=4
hope your doubt has been clarified.
thanks for clearance.
sir, you have suggested two prime numbers p=11 and q= 19 right!! so what should we consider as encryption (e) value and decryption (d) value ??
hi pramod
here we have to find e value for encryption by using GCD(e,pi(n)) and d value for decryption by substituting the formula which is given in the video.
Hope your doubt has been clarified.
thank you sir nice explaination
hi satish
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Sir thanks for your video it is easy to understand but can you explain RSA problem with example
Thanku so much sr for making this videos
Sir plse continue doing videos on network security sir
suppose, we are encrypting a message with m=10 and e=13 and n=221.
so, cipher text would be,
ct = m^e * mod(n)
ct = 10^13 * mod(221)
so, for large numbers, i am unable to find the value of cipher text using calculator.
So, can you please suggest us a method a to do so?
thanks sir, for detailed explanation. can u explain elliptic curve cryptography....
hi teja
soon i will try to upload it.
Hey sir,
Can you help me in this task that i have or suggest any book that explain these thing or any tutorial.
My task is this:
Syntax:ds create-user
Creates a public/private RSA pair with the names.xml and .pub.xml within the keys key directory.
The keys directory is a folder that holds public and private keys.This directory is stored somewhere as desired.It can be relative to the executable file or it can be at home or anywhere so it will suit you.So the created files will be keys /.xml and keys/.pub.xml.You are not obliged to save the keys in xml format.Keys can also be saved as a file tree.
The size of the key is optional.Names should contain only the symbols A-Z,a-z,0-9 and_.Names must not contain spaces.
Thnx sir for making this helpful video ☺
hi sir! p=19, q=23 and e= 3 what will be the value of d=? and given encrypt message is "meeting tomorrow"
TQSM sir.What can we say more than this.Fan from AP
Good explanation sir tq😊
Excellent 🎉
Sir can we consider anything for plain text size which is less than n
Nice Video Sir, Greatly explained. I have a small request. could u pls make a video on berlekamp massey algorithm. I couldn't find any video pertaining to it anywhere on google. This topic is there in our cryptography syllabus and we have got an exam in the coming week. could you please make a video on it by giving an example as well.
its amazing sir
hi chandan
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.