NETWORK SECURITY - RSA ALGORITHM
Вставка
- Опубліковано 8 жов 2024
- RSA Algorithm is the example for Public Key Encryption algorithm.
Here we are supposed to find two keys
1) Public Key which is used at encryption
2) Private Key which is used at decryption
step 1: Select two large Primes P , Q
Step 2: Calculate n=P*Q & O(n) = (P-1)*(Q-1)
Step 3: Assume e and d (Public and Private Key).
Step 4: Encrypt the Plain Text using Public Key e.
Step 5: Decrypt the Cipher Text using Private Key d.
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
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, I am your fan.You are doing a great job. I have exam day after tomorrow and you have saved my life.
you are the teacher that i never had. thank you so much sir.
this is the easiest nd simplest way to explain the concept.....tqu sir ......its very useful to me ....
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 !!
This the best explanation I found on UA-cam. 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❤️
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.
Sir,i wrote in this question in my exams also,,,it is very easy after listen your lecture........superrr lecture sir
Chala clarity ga explain chesaru sir thank you so much sir
Thank you so much sir, tomorrow I have my exam and this video helped a lot. You explain very nicely
Because of u I did my xam well today👍, Thanks alot😊😊😊
Tq sir your explanation is awesome , got cleared in rsa
I respect your patience and good explanation
sir thanks for the video!Am using your video for my exam preparation
Awesome Explanation Sir! Won't find a better explanation anywhere!
Thank you and it help to understand the algorithm which I need to do some assignment from university
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.
Can't thank you enough .... Great lectures , wish you all the best.
Excellent presentation, very lucid, U r simply superb sir
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....
Very Good Sir, Many Thanks for your teaching and your knowledge. Harry, Ireland
Thanks for uploading this!
Your playlist is pretty good as well!
Awesome explanation. Really helped in my test. Thanks very much
coming back to recall memory of rsa calculation for upcoming exam :)
Save lot of time and thanks for detailed information you going to right way.....
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.)
thank you sir !. you are the best teacher
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
Tq sir...very gud explanation..understood clearly
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 making such videos those all videos are useful to us
very good explanation, thank you very much sir!!!!
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.
amazing explanation. thank you.
sir you are great, we are thankful to you,but you should reduce duration of tutorials
Excellent teaching sir
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
WELL EXPLAINED SIR
WILL YOU HAVE LECTURE ON ECC (ELIPTIC CRYPTGRAPHY CURVE)
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
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 so much for making this simple ! Respect+
I will decompose the RSA of any complexity into multipliers. Fast and not expensive.
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..??
Sir thanks for your video it is easy to understand but can you explain RSA problem with example
thank you very much sir
If I pass my exams tomorrow, you are my god.
All the very best for your exams
Very well explained
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
Very gud explanation sir .....tq sir
Thank you so much for this detailed explanation 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.
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..
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?
TQSM sir.What can we say more than this.Fan from AP
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
super explaination 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.
Sir, you really saved my life!! Eager to see more......keep going
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
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.
thanks sir for such good explanation
Very efficient Teacher
thank you
are you considering the plain text is same as cipher text how it is possible??
Great job sir.
thank you so much! you did a great job!
Thank you sir! Really helpful for cns exam
Nice explaination sir
Thank you sir
Great Explanation. Thanks.
hi sir! p=19, q=23 and e= 3 what will be the value of d=? and given encrypt message is "meeting tomorrow"
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.
Thanks sir
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).
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
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?
Why did we consider plain text msg as 4.
I put in 1.5 playback speed it was really good at last moment
thanks sir, for detailed explanation. can u explain elliptic curve cryptography....
hi teja
soon i will try to upload it.
Answer values is different in encryption and decryption sir,is this correct or not
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.
Thx sir for d explanation
Could u plz explain ques p=17 q=11 e=7 d=21 m=88 what will b c=?
How we will calculate
Plz explain in detail
Not able to calculate in large prime no
Especially mod
hi Ritzie
i found the procedure in the net itself.
plz send a mail to askme.selflearning@gmail.com
so that i will send the procedure 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.
It's not d value is 21
It's 23
Bcz
D*e mod 160=1 i.e d=23
Then c will be 11
sir plz explain how we will take d and e values like if we have e=17 and n=187 in calculate d=13 but in solution it is given as d=113 how??????plz reply as soon as possible i have an exam
You saved my 15 marks for tomorrow's exam
Sir, if plain text is an alphabet, will we take its corresponding binary equivalent
Sir please solve this
What is the cipher text of plain text is 63 and public key is 13?By using RSA method
sir plz clarify my doubt that You have taken M=4 by assuming itself.but is it necessary that M Value should always be greater than e value. tq
nice lecture sir
Excellent 🎉
SIr there are some cases in which d does not exist for e in d*e mod(phi(n))=1 function what we do in such situation ???
hello sir if we take example as prime numbers 7 and 11 its not giving the perfect 1 as reminder how to over come this problem
superb teachng sir
What if m is not less than n ?.... Plain text can be anything, we can't fix the value of m that we get from plain text... Reply please
Sir encryption key can be non prime number such as its co prime with phi(n) but also non prime number e.g 8,17 is it possible??