Skip to content
#

prime-factorizations

Here are 60 public repositories matching this topic...

This project implements the Rabin Cryptosystem in SageMath, a public-key encryption algorithm based on the integer factorization problem. The system uses blum primes for p and q to simplify the decryption process.

  • Updated Oct 14, 2024
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the prime-factorizations topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the prime-factorizations topic, visit your repo's landing page and select "manage topics."

Learn more