RSA Factoring Challenge
We have sniffed an unsecured network and found numbers that are used to encrypt very important documents. It seems that those numbers are not always generated using large enough prime numbers.
Your mission should you choose to accept it, is to factorize these numbers as fast as possible before the target fixes this bug on their server - so that we can decode the encrypted documents.
This project is NOT mandatory at all. It is 100% optional. Doing any part of this project will add a project grade of over 100% to your average. Your score won’t get hurt if you don’t do it, but if your current average is greater than your score on this project, your average might go down. Have fun!
Resources
- Read or watch:
- RSA
- How does HTTPS provide security?
- Prime Factorization
- Why RSA?
Requirements
- General
- You can choose the language of your choice.
- OS needs to be Standard Ubuntu 20.04 LTS/
Author
- Michael Shell-thon