ebubecodes / RSA-Factoring-Challenge

This is an optional challenge

RSA Factoring Challenge

This project was on RSA factoring.

Summary

I learnt about RSA, how HTTPS provide security, Prime Factorization and the significance of RSA.

Requirements

• OS: Ubuntu 20.04 LTS
• Time limit: Program must not run for more than 5 seconds.

Files

Each file contains the solution to a task in the project.

• factors: A Python script that factorizes as many numbers as possible into a product of two smaller numbers.

Usage:

$ factors <file>
$ n=p*q
$ ...

• one factorization per line

• p and q (might not be prime numbers, but are factors of n)

• rsa: A similar script like factors, but p and q are always prime numbers.

Usage:

$ rsa <file>
$ n=p*q

• (<file> contains only one number)

• Cfactors.c: A C Source code for factors (incomplete). To test it:

$ gcc -Wall -Wextra -Werror -pedantic  -std=gnu99 Cfactors.c -o Cfactors -lm
$ Cfactors <file>
$ n=p*q
$ ...

• tests: A folder of test files. Provided by Alx.