A NETWORK SECURITY APPROACH USING RSA.

3,961 views

Published on

IT IS BASED ON THE PRINCIPLE OF ENCRYPTION AND DECRYPTION OF DATA USING RSA.......
RSA STANDS FOR RON RIVEST ,ADI SHAMIR & LEONARDO ADDLEMAN.

0 Comments
5 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
3,961
On SlideShare
0
From Embeds
0
Number of Embeds
10
Actions
Shares
0
Downloads
0
Comments
0
Likes
5
Embeds 0
No embeds

No notes for slide

A NETWORK SECURITY APPROACH USING RSA.

  1. 1. SMT.BHAGWATI CHATURVEDI COLLEGE OF ENGG.LokmanyaTilakJankalyanShikshanSanstha<br />PAPER<br />PRESENTATION<br />A NETWORK SECURITY APPROACH : RSA ALGORITHM<br />GUIDED BY –<br />PROF. MANOJ CHAUDARY SIR<br />Presented By :<br />TUHIN DAS <br />IV SEM<br />C.S.E <br />
  2. 2. CONTENTS<br /><ul><li>Overview of encryption and decryption.
  3. 3. Method of Encryption & Decryption .
  4. 4. Introduction to RSA    . 
  5. 5. Example of RSA algorithm .
  6. 6.   Security of RSA.
  7. 7. RSA currently in use today. 
  8. 8. Advantages & limitations.   
  9. 9.   Conclusion.
  10. 10. References  .                                 </li></li></ul><li>Overview of encryption and decryption<br /><ul><li>Encryption : The process of converting plaintext into ciphertext.
  11. 11. Decryption : The process of turning ciphertext back into the original plaintext.
  12. 12. Encryption algorithm : Algorithm that performs various transformation operation on plaintext.
  13. 13. Decryption algorithm : Accepts the ciphertext ,matching key and produce plaintext.
  14. 14. Cryptology : Branch of mathematics which deals with both cryptography and cryptoanalysis.
  15. 15. Cryptography : Branch of cryptology which deals with making communications secure.</li></li></ul><li> <br /> <br /> <br />METHOD OF ENCRYPTION & DESCRYPTION<br />KEY GENERATOR<br />ENCRYPTEDMESSAGE<br />
  16. 16. R S A<br /><ul><li>RSA is invented by Ron Rivest , AdiShamir and Leonard Adleman in 1977.
  17. 17. In RSA algorithm plaintext and ciphertext are integers between 0 and n-1 for some n.
  18. 18. There are two types of keys public & private keys which is a pair of keys that have been selected so that if one is used for encryption , the other is used for decryption.
  19. 19. Both sender and receiver must know the value of n.
  20. 20. The sender knows the value of e and only receiver knows the value of d.</li></li></ul><li>Example of RSA algorithm<br /><ul><li> Select two prime nos. , p=17 and q=11.
  21. 21. Calculate n = p*q = 17*11 = 187.
  22. 22. Calculate phi (n) = (p-1)*(q-1) = 16 * 10 =160.
  23. 23. Select e such that GCD(phi (n) ,e)=1 ; 1<e<phi(n).
  24. 24. Determine d such that d*e ~ 1 (mod 160) and d<160.</li></li></ul><li>OUTPUT:-<br />
  25. 25. SECURITY OF RSA<br /> The security of the system depends on two critical assumptions:<br />1) Factoring is required to break the system, and <br />Factoring is `inherently computationally intractable&apos;, or, alternatively, `factoring is hard‘<br /> and `any approach that can be used to break <br /> the system is at least as hard as factoring&apos;.<br />
  26. 26. RSA Currently in Use Today <br /><ul><li>RSA is currently used in a wide variety of products, platforms, and industries around the world.
  27. 27. It is found in many commercial software products. It is built into current operating systems by Microsoft, Apple and etc.
  28. 28. In hardware, RSA can be found in secure telephones, on Ethernet network cards, and on smart cards. In addition, RSA is incorporated into all of the major protocols for secured Internet communication.
  29. 29. It is also used internally in many institutions, major corporations, national laboratories, and universities.</li></li></ul><li> ADVANTAGES :<br /><ul><li>Provides security from unauthorized user/access.
  30. 30. This technique can be used in various fields 0f </li></ul> banking and National Security Service (NSS) .<br />TECHNICAL ADVANTAGES & BENEFITS :<br />ClassicSys is easy to implement in integrated circuits because:<br /><ul><li>it uses only XOR and branching functions.
  31. 31. no reporting arithmetic bits are needed.
  32. 32. Programming can be done with a polynomial structure.
  33. 33. The length of the blocks of key and data are identical and equal to 128 bits (16 bytes). </li></li></ul><li>CONCLUSION<br /><ul><li>It is most popular and most efficiently used algorithm due to its stability and reliability.
  34. 34. RSA is one of the standard algorithms that is used in most of the encryptions and decryption tasks.</li></ul>REFERENCES<br />Cryptography And Network Security - By William Stallings.Principles Of Key Management - By W .Fumy And P. Landrock.A Comparative Study Of RSA Encryption And Decryption – By R.E Ting And S.T. Barnum.<br />
  35. 35. THANK YOU .....<br />

×