RSA Algorithm Part-1 Explained With Solved Example in Hindi

Myself Shridhar Mankar a Engineer l YouTuber l Educational Blogger l Educator l Podcaster.
My Aim- To Make Engineering Students Life EASY.




A small donation would mean the world to me and will help me to make AWESOME videos for you.

Playlists :

• 5 Minutes Engineering Podcast :

• Aptitude :

• Machine Learning :

• Computer Graphics :

• C Language Tutorial for Beginners :

• R Tutorial for Beginners :

• Python Tutorial for Beginners :

• Embedded and Real Time Operating Systems (ERTOS) :

• Shridhar Live Talks :

• Welcome to 5 Minutes Engineering :

• Human Computer Interaction (HCI) :

• Computer Organization and Architecture :

• Deep Learning :

• Genetic Algorithm :

• Cloud Computing :

• Information and Cyber Security :

• Soft Computing and Optimization Algorithms :

• Compiler Design :

• Operating System :

• Hadoop :

• CUDA :

• Discrete Mathematics :

• Theory of Computation (TOC) :

• Data Analytics :

• Software Modeling and Design :

• Internet Of Things (IOT) :

• Database Management Systems (DBMS) :

• Computer Network (CN) :

• Software Engineering and Project Management :

• Design and Analysis of Algorithm :

• Data Mining and Warehouse :

• Mobile Communication :

• High Performance Computing :

• Artificial Intelligence and Robotics :

[rohitadke]

So basically we can take any prime number as value of e from 1 to phi(n).

[ashwinishewale]

Sir bahot achha... Aapke teaching ko hum dekhte ye isiliye hume acche marks milte he.. Thank u sir.... Plz machine learning..

[shrutisharma]

Please don't ever stop making these videos! They are so helpful and easy to understand.. you just saved me hours of hard work. You are brilliant sir!

[universalrhythm]

I don't think it will be complex if one doesn't know p and q but knows only n. For a fact one knows that n=p*q and p and q are prime number. So one must factorize the given value n, such that they get n=a*b say. Now one can know that either a=p or q and b=q or p. Now we can find phi(n) using phi=(p-1)(q-1). Hope this helps :)

[meetagrawal]

Sir I want to pay you tution fess because I watch videos from your channel and always score good mark god bless you😊😊😊😊

[amanakeet]

you are amazing sir, this enthusiasm is what teachers need

[harshitpaliwal]

Perfect channel name 5 min engineering, you really have made engineering very easy . Your channel has helped a lot, Thanks man 🤞

[manish]

Please explain the Fully Homomorphic Encryption in detail including the algorithms used in it.

[srishtikrishna]

We request to do more complete video on Cyber Security topics and for interview preparation. Thanks a lot your all the videos for us.

[gp]

In RSA algorithm, the value of n is 3007 and the value of ∅ (n) is 2880 where ∅ is the Euler’s totient function. What is the value of the prime factor which greater than 50?

[priyakhedekar]

Thank you ao much sir.. for making vdo on demand😊

[emanch]

Sir am ur very biggest fan from pakistan ... Your videos help us too much.. and i just wanna say k mere achy grades ki wjah ap indian YouTubers hain ... Aj 1st time me kisi YouTuber k acc pr comment kr rahi hu or bht dil se kr rahi hu once again tysm for help us free of cost🥺🫂💗

[freethinkers]

u deserve millions likes, subscriber...

[rishabhagnihotri]

For calculating phi(n) there is a direct formula, there is no complexity.

[stutijain]

How to assume a e value plzz explain a e value process also

[positiveinformationandfun]

Dear Sir, I follow your all lectures, your teaching way is really amazing and outstanding, i want you make one video on Redactable Signature Schemes, I am working on this and i need your help in this. Thank you.

[rohitkumardubey]

why are we not taking e as 7 as 7 also satisfies the condition for choosing e, can someone please explain?

[blunderfoxbeta]

This video deserves infinite likes♥️♥️♥️♥️♥️

[ourhood]

Commen factor not right
3120÷17=183.529

[arpitghildiyal]

Sir is is example 'e' ki value 7 ho sakti hai