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

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

Last synced: 16 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/jmoseka/rsa-factoring-challenge
• Owner: jmoseka
• Created: 2021-12-12T17:26:04.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2021-12-12T17:34:52.000Z (about 3 years ago)
• Last Synced: 2023-03-11T20:22:23.687Z (almost 2 years ago)
• Language: Python
• Size: 3.91 KB
• Stars: 5
• Watchers: 2
• Forks: 6
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
RSA Factoring Challenge\

\

0.Factorize all the things!

#### 0\. Factorize all the things!#advanced

Factorize as many numbers as possible into a product of two smaller numbers.

-   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

-   Push all your scripts, source code, etc... to your repository

    -   we will only run your executable`factors`

#### 1\. RSA Factoring Challenge#advanced

RSA Laboratories states that: for each RSA number`n`, there exist prime numbers`p`and`q`such that

`n`=`p`×`q`. The problem is to find these two primes, given only`n`.

This task is the same as task 0, except:

-   `p`and`q`are always prime numbers

-   There is only one number in the files

How far can you go in less than 5 seconds?

-   Read:[RSA Factoring Challenge](https://intranet.hbtn.io/rltoken/8F5ClnjOFgDcNZXxeyrHxg "RSA Factoring Challenge")