{"id":25533242,"url":"https://github.com/hptrk/uni-rabin-encryption-python","last_synced_at":"2026-04-30T19:32:36.004Z","repository":{"id":276366147,"uuid":"929073567","full_name":"hptrk/UNI-Rabin-Encryption-Python","owner":"hptrk","description":"(UNIVERSITY) Implementation of the Rabin cryptosystem and digital signatures using modular arithmetic and prime number theory. Includes encryption, decryption, and signature verification with a detailed PDF report.","archived":false,"fork":false,"pushed_at":"2025-02-07T19:04:38.000Z","size":880,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-29T14:24:37.218Z","etag":null,"topics":["cryptography","python","rabin-cryptosystem","sagemath","university-project"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hptrk.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-02-07T18:57:27.000Z","updated_at":"2025-02-07T19:23:42.000Z","dependencies_parsed_at":"2025-02-07T20:22:33.129Z","dependency_job_id":"012f430b-9531-4720-8292-afc2672df2ed","html_url":"https://github.com/hptrk/UNI-Rabin-Encryption-Python","commit_stats":null,"previous_names":["hptrk/uni-rabin-encryption-python"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hptrk/UNI-Rabin-Encryption-Python","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hptrk%2FUNI-Rabin-Encryption-Python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hptrk%2FUNI-Rabin-Encryption-Python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hptrk%2FUNI-Rabin-Encryption-Python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hptrk%2FUNI-Rabin-Encryption-Python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hptrk","download_url":"https://codeload.github.com/hptrk/UNI-Rabin-Encryption-Python/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hptrk%2FUNI-Rabin-Encryption-Python/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32475192,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-30T13:12:12.517Z","status":"ssl_error","status_checked_at":"2026-04-30T13:12:06.837Z","response_time":57,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cryptography","python","rabin-cryptosystem","sagemath","university-project"],"created_at":"2025-02-20T02:18:18.373Z","updated_at":"2026-04-30T19:32:35.981Z","avatar_url":"https://github.com/hptrk.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🔐 Rabin Encryption \u0026 Digital Signature\n\nThis project implements **Rabin encryption** and **digital signatures** using **large prime numbers, modular arithmetic, and the Chinese Remainder Theorem (CRT)**. It was developed as a **university assignment** for studying cryptographic algorithms.\n\n## 📜 Features\n- **Key Generation**: Generates large prime numbers `p` and `q`, ensuring they are congruent to `3 mod 4`.\n- **Encryption**: Uses Rabin's quadratic residue method for secure encryption.\n- **Decryption**: Recovers four possible plaintexts using **CRT**.\n- **Digital Signatures**: Implements a signing and verification mechanism.\n- **Comprehensive Documentation**: Includes a **PDF report** explaining the algorithm and implementation.\n\n## 🛠️ Technologies\n- **Language**: Python (SageMath)\n- **Concepts**: Number theory, modular arithmetic, prime number generation\n\n## 📄 Documentation\nA **detailed PDF report** is included, explaining:\n- The Rabin cryptosystem\n- Mathematical foundations\n- Implementation details\n- Code structure\n\n## 🚀 Usage\n```python\np, q, n = generate_key()\nmessage = 7\nciphertext = encrypt(message, n)\nm1, m2, m3, m4 = decrypt(ciphertext, p, q)\nsignature = sign(message, p, q)\nis_valid = verify(signature, message, n)\n```\n\n## 📌 University Project\nThis project was completed as part of a Discrete Models course assignment at ELTE.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhptrk%2Funi-rabin-encryption-python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhptrk%2Funi-rabin-encryption-python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhptrk%2Funi-rabin-encryption-python/lists"}