The RSA Algorithm

Table of contents Introduction Operation of the RSA algorithm

Key generation Encryption

The RSA Algorithm

Decryption

Security Conclusion

The RSA Algorithm

Table of contents
Table of contents Introduction

Introduction Operation of the RSA algorithm Key generation Encryption Decryption Security Conclusion

Operation of the RSA algorithm

Key generation Encryption Decryption

Security Conclusion

The RSA Algorithm

Introduction
Table of contents Introduction Operation of the RSA algorithm
Key generation Encryption

by Rivest, Shamir & Adleman (RSA) in 1977 best known & widely used protection of many things (ex credit cards) the most secure code

Decryption

Security Conclusion

The RSA Algorithm

Introduction
Table of contents Introduction

In cryptography, RSA is an algorithm for public key cryptography. The RSA algorithm involves the use of two keys : a public key, which may be known by anybody, and can be used to encrypt messages a private key, known only by the recipient, and used to decrypt messages

Operation of the RSA algorithm

Key generation Encryption Decryption

Security Conclusion

Operation of the RSA algorithm

Key generation

The RSA Algorithm

Table of contents Introduction

1. Choose 2 distinct random prime numbers : p, q 2. Compute n = p.q 3. Compute (n) = (p 1)(q 1) (Eulers totient function) 4. Choose an integer e, such that 1 < e < (n) and gcd(e, (n)) = 1 5. Compute d e1 mod [(n)] 6. Publish the public encryption key : (e, n) 7. Keep secret private decryption key : (d , n)

Operation of the RSA algorithm

Key generation Encryption Decryption

Security Conclusion

Operation of the RSA algorithm

Encryption

The RSA Algorithm

Table of contents Introduction Operation of the RSA algorithm

Key generation Encryption Decryption

To encrypt a message the sender has to : obtain public key of recipient (e, n) represent the message as an integer m in [0, n 1] compute : c = me mod n

Security Conclusion

Operation of the RSA algorithm

Decryption

The RSA Algorithm

Table of contents Introduction Operation of the RSA algorithm

Key generation Encryption Decryption

Security

To decrypt the ciphertext c the recipient : uses his private key (d , n) computes : m = c d mod n

Conclusion

The RSA Algorithm

Security
Table of contents Introduction

When attempting to attack the RSA, the attacker : has access to the public key (e, n) wants the private key (d , n) Three ways to attack RSA : force the search of key ( impossible given the size of the numbers) launch attacks during the decryption mathematical attack

Operation of the RSA algorithm

Key generation Encryption Decryption

Security Conclusion

Security
Mathematical attack

The RSA Algorithm

Table of contents Introduction Operation of the RSA algorithm

Key generation Encryption Decryption

To get d : factorize n p and q (n) d For small numbers, it is very easy to hack a RSA code.

Security Conclusion

Factorize the number n.

With Maple : write " ifactor(n) ". possible only for numbers < 1035 . very easy to nd large prime numbers.

The RSA Algorithm

Conclusion
Table of contents Introduction Operation of the RSA algorithm

The RSA algorithm is based on the fact that it is far more difcult to factorize a product of two primes than it is to multiply the two primes. Factoring n is the best known attack against RSA to date. It cannot guarantee 100% security, only added protection.

Key generation Encryption Decryption

Security Conclusion