Lazyfact tries to factorise a RSA modulus using very basic methods. This project is created for educational purposes and covers the following subjects:

• C, GMP
• C, OpenSSL
• Python, C extensions/packaging
• Python, threading using Queue
• Semiprime integer factorisation
  • Trial division
  • Pollards rho
  • Shanks squares
  • Findings another semiprime with a common GCD

Usage - building/installing

$ cd src
$ sudo python setup.py install

Usage - using

$ cd tryOut
$ gcc generator.c -o generator -lgmp -lcrypto 
$ ./generator > moduli.txt
$ python lazyfactThreading.py

Sources / Reading

• Factoring RSA moduli (semiprime integer factorisation)

  • Integer factorisation on Wikipedia
  • Stanford Crypto course

• GMP

  • GMP on Wikipedia
  • GMP integer functions manual

• OpenSSL

  • OpenSSL RSA functions manual

• Python threading using Queue

  • Python Queue manual

• Creating a Python C extension and packaging

  • Python manual - C extensions
  • Python manual - C extensions building
  • Python manual - package setup
  • Article about Python C extensions and GIL thread locking

• Licensing

  • Creative common license