1. SMT.BHAGWATI CHATURVEDI COLLEGE OF ENGG.LokmanyaTilakJankalyanShikshanSanstha PAPER PRESENTATION A NETWORK SECURITY APPROACH : RSA ALGORITHM GUIDED BY – PROF. MANOJ CHAUDARY SIR Presented By : TUHIN DAS IV SEM C.S.E
14. Cryptology : Branch of mathematics which deals with both cryptography and cryptoanalysis.
15.
16.
17. In RSA algorithm plaintext and ciphertext are integers between 0 and n-1 for some n.
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. Both sender and receiver must know the value of n.
25. SECURITY OF RSA The security of the system depends on two critical assumptions: 1) Factoring is required to break the system, and Factoring is `inherently computationally intractable', or, alternatively, `factoring is hard‘ and `any approach that can be used to break the system is at least as hard as factoring'.
26.
27. It is found in many commercial software products. It is built into current operating systems by Microsoft, Apple and etc.
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.
34. RSA is one of the standard algorithms that is used in most of the encryptions and decryption tasks.REFERENCES 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.