Pure-Python library that provides a selection of Sophie Germain primes that are organized by representation size.
-
Updated
Mar 27, 2024 - Python
Pure-Python library that provides a selection of Sophie Germain primes that are organized by representation size.
This library help to find prime numbers between given range
The paper titled "A secure authenticated image encryption scheme based on elliptic curve cryptography" proposes a robust method for securely transmitting images, particularly medical ones, by employing an authenticated encryption. This algorithm integrates the LRNG, SGPG, and ECC to enhance the randomness and security of the encryption process.
I started with the Python code, then added multithreading in V2, then translated it to Java and C++(11), the C code I have also compiled to a Linux binary.
This code generates Sophie Germain primes and safe primes up to 10 digits
Add a description, image, and links to the sophie-germain-primes topic page so that developers can more easily learn about it.
To associate your repository with the sophie-germain-primes topic, visit your repo's landing page and select "manage topics."