A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. The focus was on readability and understandability of the code, not performance.
-
Updated
Sep 5, 2024 - C#
A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. The focus was on readability and understandability of the code, not performance.
Very large integer factorization implemented in Python
EPR: A Factoring and Primality checking library for C
Mathematical cryptography (custom implementations).
Implementing various methods of prime factorisation on very large numbers handled using strings.
A programmatic animation of the LLL algorithm, made using manim (Python)
Add a description, image, and links to the lenstra topic page so that developers can more easily learn about it.
To associate your repository with the lenstra topic, visit your repo's landing page and select "manage topics."