**RSA Algorithm Computer Science Seminar Topics 2011** was discovered by three scientists, Ron Rivest, Adi Shamir and Len Adleman. This scheme is a block cipher where plain text and cipher text are integers between 0 and n-1 for some value n. The typical size of n is 1024 bits or 309 decimal digits. It is a public key encryption RSA scheme.

The two pairs of integers {e, n} and {d, n} are used in this scheme. First of them {e.n} is called the RSA public key and the other one {d, n} is called the RSA secret key. The sender uses the public key to encrypt the message into cipher text.

It is expressed as **C = M^e mod n**.

Here C is the cipher text and M is the message or the plane text. At the receiving end, the receiver receives the cipher text C and decrypts C into M using secret key {d, n}.

**KEY GENERATION: **The method of Key Generation consists of following steps:

1. Select two prime numbers say p and q randomly Where p ≠ q.

2. Calculate n = p *q.

3. Calculate Ø(n) = (p-1) (q-1).

Applications of RSA are: It is widely used for encryption and decryption in message process to get secure communication. It is used for digital signature. It is used for key distribution. It is used in e-commerce and remote banking.

**Conclusion:**

It is concluded that RSA is a powerful scheme most widely utilized for digital signature and encryption/decryption. It is more secure than DES and other schemes. It is known that that the key length RSA use has increased for security purpose. Using RSA, it has a heavier processing load on applications. This scheme has ramified especially for electronic commerce sites that have large numbers of transactions. RSA is fundamentally an easy method to explain than ECC.

**Download** RSA Algorithm Computer Science Seminar Topics 2011.