{"id":42997667,"url":"https://github.com/crocs-muni/cm_factorization","last_synced_at":"2026-01-31T03:35:26.533Z","repository":{"id":54548483,"uuid":"162490338","full_name":"crocs-muni/cm_factorization","owner":"crocs-muni","description":"Complex multiplication based factorization","archived":false,"fork":false,"pushed_at":"2022-02-21T15:19:12.000Z","size":1318,"stargazers_count":38,"open_issues_count":0,"forks_count":5,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-09-10T06:17:22.815Z","etag":null,"topics":["complex-multiplication","elliptic-curves","factorization","secrypt-2019"],"latest_commit_sha":null,"homepage":"https://crocs.fi.muni.cz/public/papers/Secrypt2019","language":"Jupyter Notebook","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/crocs-muni.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2018-12-19T21:01:29.000Z","updated_at":"2025-05-14T02:23:12.000Z","dependencies_parsed_at":"2022-08-13T19:20:35.125Z","dependency_job_id":null,"html_url":"https://github.com/crocs-muni/cm_factorization","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/crocs-muni/cm_factorization","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crocs-muni%2Fcm_factorization","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crocs-muni%2Fcm_factorization/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crocs-muni%2Fcm_factorization/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crocs-muni%2Fcm_factorization/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/crocs-muni","download_url":"https://codeload.github.com/crocs-muni/cm_factorization/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crocs-muni%2Fcm_factorization/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28928148,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-31T02:59:34.861Z","status":"ssl_error","status_checked_at":"2026-01-31T02:59:05.369Z","response_time":128,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: 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":["complex-multiplication","elliptic-curves","factorization","secrypt-2019"],"created_at":"2026-01-31T03:35:26.041Z","updated_at":"2026-01-31T03:35:26.520Z","avatar_url":"https://github.com/crocs-muni.png","language":"Jupyter Notebook","readme":"# CM-based factorization\nComplex multiplication based factorization.\nThis repository contains proof of concept factorization code and scripts used in experiments.\n\n## Proof of concept script usage\n\nGenerating CM primes:\n\n```bash\nsage cm_factor.sage --action generate --prime-bits 64\n16344322632527439553\n```\n\nCM factorization:\n\n```bash\nsage cm_factor.sage -N 158697752795669080171615843390068686677 -D 11\nFactorization of N: 158697752795669080171615843390068686677 is: \n14793660019451035033 * 10727416514034371869\n```\n\n## Advanced usage script\n\nMore complex script that was used to run experiments covered in the paper is `experiments.sage`.\nIt covers distributed computation of the factorization, class number sampling, batch BCD computation, \nHilbert polynomial generation, primorial D computation, benchmarking.\n\n\n## Dependencies\n\nSage 8 is required. Included packages `coloredlogs`, `humanfriendly` are optional.\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcrocs-muni%2Fcm_factorization","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcrocs-muni%2Fcm_factorization","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcrocs-muni%2Fcm_factorization/lists"}