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

This is a RSA Factoring challenge repository from ALX
https://github.com/brendon45/rsa-factoring-challenge

Last synced: about 2 months ago
JSON representation

This is a RSA Factoring challenge repository from ALX

• Host: GitHub
• URL: https://github.com/brendon45/rsa-factoring-challenge
• Owner: Brendon45
• Created: 2024-03-04T12:09:48.000Z (10 months ago)
• Default Branch: master
• Last Pushed: 2024-03-04T14:48:43.000Z (10 months ago)
• Last Synced: 2024-03-05T15:10:54.107Z (10 months ago)
• Language: Python
• Size: 2.93 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# RSA Factoring Challenge

## Algorithm

## Scripting

## Requirements

## General:

- You can choose the language of your choice.

- OS needs to be Standard Ubuntu 20.04 LTS/

## Tasks

## TASK 0.

Factorize all the things!

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

## TASK 1. 

RSA Factoring Challenge

Score: 0.0% (Checks completed: 0.0%)

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