{"id":15718092,"url":"https://github.com/choyiny/factorizing-semiprimes","last_synced_at":"2025-07-11T07:37:56.158Z","repository":{"id":28095295,"uuid":"31593350","full_name":"choyiny/factorizing-semiprimes","owner":"choyiny","description":"Factorizing Semiprimes (Proof of concept to decrypt RSA keys)","archived":false,"fork":false,"pushed_at":"2016-11-03T13:27:16.000Z","size":47,"stargazers_count":3,"open_issues_count":0,"forks_count":9,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-29T18:02:58.701Z","etag":null,"topics":["factorize","hacking-rsa","java","semiprime"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/choyiny.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-03-03T10:43:40.000Z","updated_at":"2022-11-29T07:10:56.000Z","dependencies_parsed_at":"2022-09-02T18:23:06.475Z","dependency_job_id":null,"html_url":"https://github.com/choyiny/factorizing-semiprimes","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/choyiny%2Ffactorizing-semiprimes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/choyiny%2Ffactorizing-semiprimes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/choyiny%2Ffactorizing-semiprimes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/choyiny%2Ffactorizing-semiprimes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/choyiny","download_url":"https://codeload.github.com/choyiny/factorizing-semiprimes/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250306601,"owners_count":21408927,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["factorize","hacking-rsa","java","semiprime"],"created_at":"2024-10-03T21:52:06.303Z","updated_at":"2025-04-22T19:20:38.200Z","avatar_url":"https://github.com/choyiny.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"IB Math HL IA - Hacking RSA (kinda)\n===============\n[![Build Status](https://travis-ci.org/choyiny/factorizing-semiprimes.svg?branch=master)](https://travis-ci.org/choyiny/factorizing-semiprimes)\n\nFeatured on [The Mathematics IA: Earning Full Marks on HL or SL Mathematics Explorations: Ideal for the INTERNATIONAL BACCALAUREATE DIPLOMA](http://www.amazon.com/gp/product/B00U4UE8EA/) as a method to increase personal engagement and a proof of authenticity.\n\nI've created this java program as part of my International Baccalaureate Mathematics Higher Level Internal Assessment. This is a proof of concept for factorizing public keys and crack the RSA cryptographic algorithm.\n\nUsage\n----------------\nReplace n with the semiprime you wish to factorize.\n\nHow does it work?\n----------------\nThis script uses 2 methods to factorize semiprimes.\n- Brute Force Method\n- Fermat's Factorization Method\n- Pollard's Rho Method\n\nLimitations\n----------------\nThe code can only factorize the maximum of a JAVA_INT, 2^31 - 1.\n\nSample output\n----------------\n````\nn = 397927\nFF: 433 is a factor\nFF: 919 is another factor\nFF: Total execution time: 0ms\nFF: steps involved: 22\nBF: 433 is a factor\nBF: 919 is another factor\nBF: Total execution time: 0ms\nBF: steps involved: 215\nPF: 919 is a factor\nPF: 433 is another factor\nPF: steps involved: 51\nPF: Total execution time: 2ms\n````\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchoyiny%2Ffactorizing-semiprimes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchoyiny%2Ffactorizing-semiprimes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchoyiny%2Ffactorizing-semiprimes/lists"}