# RSA algorithm

RSA (Rivest–Shamir–Adleman) is an algorithm used by modern computers to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm. Asymmetric means that there are two different keys. This is also called public key cryptography, because one of the keys can be given to anyone. The other key must be kept private. The algorithm is based on the fact that finding the factors of a large composite number is difficult: when the factors are prime numbers, the problem is called prime factorization. It is also a key pair (public and private key) generator.

RSA involves a public key and private key. The public key can be known to everyone- it is used to encrypt messages. Messages encrypted using the public key can only be decrypted with the private key. The private key needs to be kept secret. Calculating the private key from the public key is very difficult.

## Concepts used

RSA use a number of concepts from cryptography:

• A one-way function that is easy to compute; finding a function that reverses it, or computing this function is very difficult.
• RSA uses a concept called discrete logarithm. This works much like the normal logarithm: The difference is that only whole numbers are used, and in general, a modulus operation is involved. As an example Ax=b, modulo n. The discrete logarithm is about findind the smallest x that satisfies the equation, when a b and n are provided

## Generating keys

The keys for the RSA algorithm are generated the following way:

1. Choose two different large random prime numbers ${\displaystyle p}$ and ${\displaystyle q}$. This should be kept secret.
2. Calculate ${\displaystyle n=pq}$.
• ${\displaystyle n}$ is the modulus for the public key and the private keys.
3. Calculate the totient: ${\displaystyle \phi (n)=(p-1)(q-1)}$.
4. Choose an integer ${\displaystyle e}$ such that ${\displaystyle 1, and ${\displaystyle e}$ is co-prime to ${\displaystyle \phi (n)}$.
i.e.: ${\displaystyle e}$ and ${\displaystyle \phi (n)}$ share no factors other than ${\displaystyle 1}$: ${\displaystyle \gcd(e,\phi (n))=1}$; See greatest common divisor.
• ${\displaystyle e}$ is released as the public key exponent.
5. Compute ${\displaystyle d}$ to satisfy the congruence relation ${\displaystyle de\equiv 1\!\!\!\!{\pmod {\phi (n)}}}$.
i.e.: ${\displaystyle de=1+x\cdot \phi (n)}$ for some integer ${\displaystyle x}$. (Simply to say: Calculate ${\displaystyle d=(1+x\cdot \phi (n))/e}$ to be an integer)
• ${\displaystyle d}$ is kept as the private key exponent.

Notes on the above steps:

• Step 1: Numbers can be probabilistically tested for primality.
• Step 3: changed in PKCS #1 [en] v2.0 to ${\displaystyle \lambda (n)={\rm {lcm}}(p-1,q-1)}$ instead of ${\displaystyle \phi (n)=(p-1)(q-1)}$.
• Step 4: A popular choice for the public exponents is ${\displaystyle e=2^{16}+1=65537}$. Some applications choose smaller values such as ${\displaystyle e=3}$, ${\displaystyle 5}$, or ${\displaystyle 35}$ instead. This is done to make encryption and signature verification faster on small devices like smart cards but small public exponents may lead to greater security risks.
• Steps 4 and 5 can be performed with the extended Euclidean algorithm [en]; see modular arithmetic.

The public key is made of the modulus ${\displaystyle n\,}$ and the public (or encryption) exponent ${\displaystyle e\,}$.
The personal key is made of p,q and the private (or decryption) exponent ${\displaystyle d\,}$ which must be kept secret.

• For efficiency a different form of the private key can be stored:
• ${\displaystyle p}$ and ${\displaystyle q}$: the primes from the key generation;
• ${\displaystyle d{\bmod {(}}p-1)}$ and ${\displaystyle d{\bmod {(}}q-1)}$: often called dmp1 and dmq1;
• ${\displaystyle q^{-1}{\bmod {p}}}$: often called iqmp.
• All parts of the private key must be kept secret in this form. ${\displaystyle p\,}$ and ${\displaystyle q\,}$ are sensitive since they are the factors of ${\displaystyle n\,}$, and allow computation of ${\displaystyle d\,}$ given ${\displaystyle e\,}$. If ${\displaystyle p\,}$ and ${\displaystyle q\,}$ are not stored in this form of the private key then they are securely deleted along with other intermediate values from key generation.
• Although this form allows faster decryption and signing by using the Chinese Remainder Theorem (CRT) it is considerably less secure since it enables side channel attacks [en]. This is a particular problem if implemented on smart cards, which benefit most from the improved efficiency.
(Start with ${\displaystyle y\equiv x^{e}\!\!\!\!{\pmod {n}}}$, and let the card decrypt that. So it computes ${\displaystyle (y^{d}{\bmod {p}})}$ or ${\displaystyle (y^{d}{\bmod {q}})}$, whose results give some value ${\displaystyle z}$. Now, induce an error in one of the computations. Then ${\displaystyle \gcd(z-x,n)}$ will reveal ${\displaystyle p}$ or ${\displaystyle q}$.)

## Encrypting message

Alice gives her public key ${\displaystyle (n,e)}$ to Bob and keeps her private key secret. Bob wants to send message ${\displaystyle M}$ to Alice.

First he turns ${\displaystyle M}$ into a number ${\displaystyle m}$ smaller than ${\displaystyle n}$ by using an agreed-upon reversible protocol known as a padding scheme. He then computes the ciphertext ${\displaystyle c\,}$ corresponding to:

${\displaystyle c=m^{e}\mod {n}}$

This can be done quickly using the method of exponentiation by squaring. Bob then sends ${\displaystyle c\,}$ to Alice.

## Decrypting message

Alice can recover ${\displaystyle m\,}$ from ${\displaystyle c\,}$ by using her private key ${\displaystyle d\,}$ in the following procedure:

Given ${\displaystyle m\,}$, she can recover the original distinct prime numbers, applying the Chinese remainder theorem to these two congruences yields

${\displaystyle m^{ed}\equiv m{\bmod {pq}}}$.

Thus,

${\displaystyle c^{d}\equiv m{\bmod {n}}}$.

Therefore:

${\displaystyle m=c^{d}\ mod\ n}$

### A working example

Here is an example of RSA encryption and decryption. The prime numbers used here are too small to let us securely encrypt anything. You can use OpenSSL to generate and examine a real keypair.

1. Choose two random prime numbers ${\displaystyle p}$ and ${\displaystyle q\,}$:
${\displaystyle p=61}$ and ${\displaystyle q=53\,}$;
2. Compute ${\displaystyle n=pq\,}$:
${\displaystyle \!n=61\times 53=3233\!}$;
3. Compute the totient ${\displaystyle \phi (n)=(p-1)(q-1)}$:
${\displaystyle \!\phi (n)=(61-1)(53-1)=3120\!}$;
4. Choose ${\displaystyle e>1}$ coprime to ${\displaystyle 3120\,}$:
${\displaystyle e=17\,}$;
5. Choose ${\displaystyle d\,}$ to satisfy ${\displaystyle ed\equiv 1{\bmod {\phi (n)}}}$:
${\displaystyle d=2753\,}$, with ${\displaystyle 17\times 2753=46801=1+15\times 3120}$.

The public key is (${\displaystyle n=3233}$, ${\displaystyle e=17}$). For a padded message ${\displaystyle m\,}$the encryption function ${\displaystyle c=m^{e}{\bmod {n}}}$ becomes:

${\displaystyle c=m^{17}{\bmod {3}}233\,}$

The private key is (${\displaystyle n=3233}$, ${\displaystyle d=2753}$). The decryption function ${\displaystyle m=c^{d}{\bmod {n}}}$ becomes:

${\displaystyle m=c^{2753}{\bmod {3}}233\,}$

For example, to encrypt ${\displaystyle m=123}$, we calculate

${\displaystyle c=123^{17}{\bmod {3}}233=855}$

To decrypt ${\displaystyle c=855}$, we calculate

${\displaystyle m=855^{2753}{\bmod {3}}233=123}$

Both of these calculations can be computed fast and easily using the square-and-multiply algorithm for modular exponentiation.

## Deriving RSA equation from Euler's theorem

RSA can easily be derived using Euler's theorem and Euler's totient function.

Starting with Euler's theorem,

${\displaystyle m^{\phi (n)}\equiv 1{\pmod {n}}}$

we must show that decrypting an encrypted message, with the correct key, will give the original message. Given a padded message m, the ciphertext c, is calculated by

${\displaystyle c\equiv m^{e}{\pmod {n}}}$

Substituting into the decryption algorithm, we have

${\displaystyle c^{d}\equiv (m^{e})^{d}\equiv m^{ed}{\pmod {n}}}$

We want to show this value is also congruent to m. The values of e and d were chosen to satify,

${\displaystyle ed\equiv 1{\pmod {\phi (n)}}}$

Which is to say, there exists some integer k, such that

${\displaystyle ed=k\times \phi (n)+1}$

Now we substitute into the encrypted then decrypted message,

{\displaystyle {\begin{aligned}m^{ed}&\equiv m^{k\phi (n)+1}\\&\equiv m\times m^{k\phi (n)}\\&\equiv m\times \left(m^{\phi (n)}\right)^{k}{\pmod {n}}\end{aligned}}}

We apply Euler's theorem, and achive the result.

${\displaystyle m\times (1)^{k}\equiv m{\pmod {n}}}$

When used in practice, RSA must be combined with some form of padding scheme, so that no values of M result in insecure ciphertexts. RSA used without padding may have some problems:

• The values m = 0 or m = 1 always produce ciphertexts equal to 0 or 1 respectively, due to the properties of exponentiation.
• When encrypting with small encryption exponents (e.g., e = 3) and small values of the m, the (non-modular) result of ${\displaystyle m^{e}}$ may be strictly less than the modulus n. In this case, ciphertexts may be easily decrypted by taking the eth root of the ciphertext with no regard to the modulus.
• RSA encryption is a deterministic encryption algorithm. It has no random component. Therefore, an attacker can successfully launch a chosen plaintext attack against the cryptosystem. They can make a dictionary by encrypting likely plaintexts under the public key, and storing the resulting ciphertexts. The attacker can then observe the communication channel. As soon as they see ciphertexts that match the ones in their dictionary, the attackers can then use this dictionary in order to learn the content of the message.

In practice, the first two problems can arise when short ASCII messages are sent. In such messages, m might be the concatenation of one or more ASCII-encoded character(s). A message consisting of a single ASCII NUL character (whose numeric value is 0) would be encoded as m = 0, which produces a ciphertext of 0 no matter which values of e and N are used. Likewise, a single ASCII SOH (whose numeric value is 1) would always produce a ciphertext of 1. For systems which conventionally use small values of e, such as 3, all single character ASCII messages encoded using this scheme would be insecure, since the largest m would have a value of 255, and 2553 is less than any reasonable modulus. Such plaintexts could be recovered by simply taking the cube root of the ciphertext.

To avoid these problems, practical RSA implementations typically embed some form of structured, randomized padding into the value m before encrypting it. This padding ensures that m does not fall into the range of insecure plaintexts, and that a given message, once padded, will encrypt to one of a large number of different possible ciphertexts. The latter property can increase the cost of a dictionary attack beyond the capabilities of a reasonable attacker.

Standards such as PKCS have been carefully designed to securely pad messages prior to RSA encryption. Because these schemes pad the plaintext m with some number of additional bits, the size of the un-padded message M must be somewhat smaller. RSA padding schemes must be carefully designed so as to prevent sophisticated attacks. This may be made easier by a predictable message structure. Early versions of the PKCS standard used ad-hoc constructions, which were later found vulnerable to a practical adaptive chosen ciphertext attack. Modern constructions use secure techniques such as Optimal Asymmetric Encryption Padding (OAEP) to protect messages while preventing these attacks. The PKCS standard also has processing schemes designed to provide additional security for RSA signatures, e.g., the Probabilistic Signature Scheme for RSA (RSA-PSS).

## Signing messages

Suppose Alice uses Bob's public key to send him an encrypted message. In the message, she can claim to be Alice but Bob has no way of verifying that the message was actually from Alice since anyone can use Bob's public key to send him encrypted messages. So, in order to verify the origin of a message, RSA can also be used to sign a message.

Suppose Alice wishes to send a signed message to Bob. She produces a hash value of the message, raises it to the power of d mod n (just like when decrypting a message), and attaches it as a "signature" to the message. When Bob receives the signed message, he raises the signature to the power of e mod n (just like encrypting a message), and compares the resulting hash value with the message's actual hash value. If the two agree, he knows that the author of the message was in possession of Alice's secret key, and that the message has not been tampered with since.

Note that secure padding schemes such as RSA-PSS are as essential for the security of message signing as they are for message encryption, and that the same key should never be used for both encryption and signing purposes.

## Other websites

• Hacking Secret Ciphers with Python, Chapter 24, Public Key Cryptography and the RSA Cipher
• Grime, James. "RSA Encryption". Numberphile. Brady Haran. Archived from the original on 2018-10-06. Retrieved 2019-06-20.
• How RSA Key used for Encryption in real world
• Prime Numbers, Factorization, and their Relationship with Encryption