Scribd
Upload
91 views

Rsa Algorithm

The document discusses the RSA encryption algorithm. It describes how RSA was developed in 1977 by Rivest, Shamir and Adleman based on work by Diffie, Hellman and Cocks exploring public-key cryptography. The algorithm uses a public and private key based on large prime numbers to encrypt and decrypt messages securely. An example is provided to illustrate how RSA encryption works step-by-step to encrypt and decrypt the message "HELLO". Security considerations of RSA like choosing large enough prime numbers and padding messages are also briefly covered.

Uploaded by

Chronicle
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
91 views

Rsa Algorithm

The document discusses the RSA encryption algorithm. It describes how RSA was developed in 1977 by Rivest, Shamir and Adleman based on work by Diffie, Hellman and Cocks exploring public-key cryptography. The algorithm uses a public and private key based on large prime numbers to encrypt and decrypt messages securely. An example is provided to illustrate how RSA encryption works step-by-step to encrypt and decrypt the message "HELLO". Security considerations of RSA like choosing large enough prime numbers and padding messages are also briefly covered.

Uploaded by

Chronicle
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

RSA ALGORITHM

The idea of an asymmetric public-private key cryptosystem is attributed


to Whitfield Diffie and Martin Hellman, who published this concept in 1976.
They also introduced digital signatures and attempted to apply number
theory. Their formulation used a shared-secret-key created from
exponentiation of some number, modulo a prime number. However, they left
open the problem of realizing a one-way function, possibly because the
difficulty of factoring was not well-studied at the time.

HISTORY
RSA (Revest–Shamir–Adleman) is a public-key cryptosystem that is widely
used for secure data transmission. It is also one of the oldest.
The acronym RSA comes from the surnames of Ron Rivest, Adi Shamir,
and Leonard Adleman, who publicly described the algorithm in 1977. An
equivalent system was developed secretly, in 1973 at GCHQ (the
British signals intelligence agency), by the English mathematician Clifford
Cocks. That system was declassified in 1997.
BLOCK DIAGRAM
BLOCK DIAGRAM

Block diagram of RSA encryption algorithms IV. Design of the RSA Encryption
Algorithm The proposed design uses to translate the data from the original data
(plaintext) to ciphertext. The proposed design of the RSA Encryption Algorithm
consists of four stages. Each stage has its work. Fig 3 shows the block diagram of
the whole RSA algorithm system. The Fig 2 shows the four stages that suggested
for the propose architecture of the RSA algorithm.

RSA cryptographic algorithm used to encrypt and decrypt the messages to send
it over the secure transmission channel like internet. The RSA algorithm is a
secure, high quality, public key algorithm. In this paper, a new architecture and
modeling has been proposed for RSA public key algorithm, the suggested system
uses 1024-bit RSA encryption/decrypt...
RSA ALGORITHM

First, the receiver chooses two large prime numbers pp and qq. Their product, n=pqn=pq, will be half of the public key.

The receiver calculates \phi(pq)=(p-1)(q-1)ϕ(pq)=(p−1)(q−1) and chooses a number ee relatively prime to \phi(pq)ϕ(pq). In
practice, ee is often chosen to be 2^{16}+1=65537216+1=65537, though it can be as small as 33 in some cases. ee will be
the other half of the public key.

The receiver calculates the modular inverse dd of ee modulo \phi(n)ϕ(n). In other words, de \equiv 1
\pmod{{\small\phi(n)}}de≡1(modϕ(n)). dd is the private key.

The receiver distributes both parts of the public key: nn and ee. dd is kept secret.

Now that the public and private keys have been generated, they can be reused as often as wanted.
RSA ALGORITHM

the sender then calculates c \equiv m^e


\pmod{n}c≡me(modn). cc is the ciphertext, or the encrypted
message. besides the public key, this is the only information
an attacker will be able to steal.

the receiver computes c^d \equiv m \pmod ncd≡m(modn),


thus retrieving the original number mm the receiver
translates mm back into letters, retrieving the original
message.
EXAMPLE OF RSA ALGORITHM
For example, suppose the receiver selected the primes p=11p=11 and q=17q=17, along with e=3e=3.
1.The receiver calculates n=pq=11 \cdot 17=187n=pq=11⋅17=187, which is half of the public key.
2.The receiver also calculates \phi(n)=(p-1)(q-1)=10 \cdot 16=160ϕ(n)=(p−1)(q−1)=10⋅16=160. e=3e=3 was also chosen.
3.The receiver calculates d=107d=107, since then de=321 \equiv 1
\pmod{{\small\phi(n)}}de=321≡1(modϕ(n)) \big((since \phi(n)=160).ϕ(n)=160).
4.The receiver distributes his public key: n=187n=187 and e=3e=3.
Now suppose the sender wanted to send the message "HELLO". Since nn is so small, the sender will have to send his
message character by character.
1.'H' is 72 in ASCII, so the message text is m=72m=72.
2.The sender calculates m^e=72^3 \equiv 183 \pmod{187}me=723≡183(mod187), making the ciphertext c=183c=183.
Again, this is the only information an attacker can get, since the attacker does not have the private key.
EXAMPLE OF RSA ALGORITHM

1.The receiver
calculates c^d=183^{107} \equiv 72
\pmod{187}cd=183107≡72(mod187),
thus getting the message
of m=72m=72.

2.The receiver translates 72 into 'H'.

The rest of the letters are sent in the


same way.

ANOTHER EXAMPLE OF RSA


SECURITY OF RSA
These are explained as following below.

1. Plain text attacks:


It is classified into 3 subcategories:-

(i) Short message attack:

In this we assume that attacker knows some blocks of plain text and tries to decode cipher text with
the help of that. So, to prevent this pad the plain text before encrypting.

(ii) Cycling attack:

In this attacker will think that plain text is converted into cipher text using permutation and he will
apply right for conversion. But attacker does not right plain text. Hence will keep doing it.
SECURITY OF RSA
(iii) Unconcealed Message attack:

Sometimes happened that plain text is same as cipher text after encryption . So it must be checked it
cannot be attacked.

2. Choosen cipher attack:

In this attacker is able to find out plain text based on cipher text using Extended Eculedian Algorithm.

3. Factorisation attack:

If attacker will able to know P and Q using N, then he could find out value of private key. This can be failed when
N contains atleast 300 longer digits in decimal terms, attacker will not able to find. Hence it fails.
TO KNOW MORE ABOUT RSA SECURITY

https://www.coursera.org/lecture/asymmetric-crypto/security-of-rsa-
94tuy?utm_source=link&utm_medium=page_share&utm_content=vlp&utm_campaign=top_button

THANK YOU
Created by: Omshree Prakash Chaudhary

You might also like