https://github.com/itsfoss0/rsa-factoring-challenge

RSA refactoring challenge. Developed my mathematicians, calculated by Developers
https://github.com/itsfoss0/rsa-factoring-challenge

alx-challenge rsa rsa-refactoring

Last synced: about 1 month ago
JSON representation

RSA refactoring challenge. Developed my mathematicians, calculated by Developers

• Host: GitHub
• URL: https://github.com/itsfoss0/rsa-factoring-challenge
• Owner: Itsfoss0
• Created: 2022-12-17T06:24:35.000Z (over 2 years ago)
• Default Branch: master
• Last Pushed: 2022-12-17T10:52:27.000Z (over 2 years ago)
• Last Synced: 2025-05-16T17:14:33.267Z (about 1 month ago)
• Topics: alx-challenge, rsa, rsa-refactoring
• Language: Python
• Homepage:
• Size: 4.88 KB
• Stars: 3
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
![img](https://assets.imaginablefutures.com/media/images/ALX_Logo.max-200x150.png)

> RSA Refactoring challenge

[![Mission Impossible](http://img.youtube.com/vi/XAYhNHhxN0A/0.jpg)](http://www.youtube.com/watch?v=XAYhNHhxN0A "Mission Impossible")

## About

This is an optional project.

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.

## Resources 

1. [RSA](https://en.wikipedia.org/wiki/RSA_(cryptosystem%29))

2. [How does HTTPS provide security](https://stackoverflow.com/questions/3968095/how-does-https-provide-security)

3. [Prime factorization](https://privacycanada.net/mathematics/prime-factorization/)

4. [Why RSA?](https://jaredatandi.hashnode.dev/rsa-factoring)

## Requirements

* [X] You can choose the language of your choice.

* [X] OS needs to be Standard Ubuntu 20.04 LTS/

## Aditional information

### USage

* Usage: ```factors ```

    * where  is a file containing natural numbers to factor.

    One number per line

    * You can assume that all lines will be valid natural numbers greater than 1

    You can assume that there will be no empy line, and no space before and after the valid number

    * The file will always end with a new line

* Output format:

    * n=p*q

    * one factorization per line

    * p and q don’t have to be prime numbers

    See example

* You can work on the numbers of the file in the order of your choice

* Your program should run without any dependency: You will not be able to install anything on the machine we will run your program on

* Time limit: Your program will be killed after 5 seconds if it hasn’t finish