New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

#

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

Jump to bottom

Implement multiprocessing on prime factorization #6

Open

martin-nohava opened this issue Nov 16, 2019 · 0 comments

Assignees

Labels

Owner

martin-nohava commented Nov 16, 2019

1) Divide factorization into three parts

Find size of modulo in bites
Divide it accordingly into parts (for small modulos don't divide it)

2) Make system process for every part

Start 3 processes
In each process will be running brute force attack on one part of modulo

martin-nohava added the enhancement label

martin-nohava assigned martin-nohava and Bloc3k and unassigned martin-nohava

# for free to join this conversation on GitHub. Already have an account? # to comment