Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
-
Updated
Dec 17, 2025 - C++
Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
This repo contains all the projects developed during my AIND journey.
A project that finds the two prime factors of a public key.
Implementing various methods of prime factorisation on very large numbers handled using strings.
Add a description, image, and links to the p-1 topic page so that developers can more easily learn about it.
To associate your repository with the p-1 topic, visit your repo's landing page and select "manage topics."