1 / 11

# What is RSA - PowerPoint PPT Presentation

What is RSA. RSA is a system employed to create the encrypted message in which the key used for encryption is different from that used to decrypt.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' What is RSA' - olin

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

• RSA is a system employed to create the encrypted message in which the key used for encryption is different from that used to decrypt.

• It is employed in all situations that require security, such as the use of cash payments, in passwords of e-mail, in digital encryption and is the most well-known algorithm for asymmetric encryption.

Howdoesit work?

Why RSA wascreated?

The RSA system has been created to answer to the necessity of a stringent security in today's society.

In previous encryption methods, in fact, there were the "pass key" between the sender and the receiver of the message. The RSA system, however, uses two keys: a public key and a private key to decrypt

The creationof RSA

The researchers then began looking for a one-way mathematical function (a function which tends to be difficult invertible) in the arithmetic clock and also the mathematicians studied the inverse operations, the multiplication of two numbers and their factorization.

Theinventors

The aim was reached by three U.S. researchers at MIT in 1977, Adi Shamir, Ron Rivest, Leonard Adleman.

• pand q, two prime numbers

• n, product of p and q

• Φ (n) = (p-1) (q-1)

• e, public key divisor of Φ (n)

• d, secret key such that e · d = 1mod Φ (n)

• M, plaintext message

• M’, encrypted message

How can you create a RSA system?

• choose two prime numbers, p and q

•   calculate n = p · q

•   calculate Φ (n) = (p-1) (q-1)

•   calculateeanddsuch that e · d = 1modΦ (n)

• To encrypt:

•   consider the message M

•   calculate M’= Me

• M’ is the encrypted message

• To decrypt:

•   consider the messageM’

•   calculate M = (M’)d

• M is the decrypted message

Generalscheme

A common application