{"id":26360061,"url":"https://github.com/g4titanx/gcd_euclidean_algorithm","last_synced_at":"2025-10-10T15:07:29.030Z","repository":{"id":243692078,"uuid":"813137454","full_name":"g4titanx/gcd_euclidean_algorithm","owner":"g4titanx","description":"this is a representation of the extended Euclidean algorithm in rust","archived":false,"fork":false,"pushed_at":"2024-06-10T15:37:38.000Z","size":5,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-25T00:31:07.059Z","etag":null,"topics":["euclidean-algorithm","rust"],"latest_commit_sha":null,"homepage":"","language":"Rust","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/g4titanx.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":"2024-06-10T14:43:52.000Z","updated_at":"2024-08-13T11:55:53.000Z","dependencies_parsed_at":"2024-06-10T18:08:31.754Z","dependency_job_id":"866ddd00-0246-4935-867d-e0cb5527f69e","html_url":"https://github.com/g4titanx/gcd_euclidean_algorithm","commit_stats":null,"previous_names":["g4titanx/gcd_euclidean_algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/g4titanx/gcd_euclidean_algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g4titanx%2Fgcd_euclidean_algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g4titanx%2Fgcd_euclidean_algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g4titanx%2Fgcd_euclidean_algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g4titanx%2Fgcd_euclidean_algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/g4titanx","download_url":"https://codeload.github.com/g4titanx/gcd_euclidean_algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g4titanx%2Fgcd_euclidean_algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279004564,"owners_count":26083734,"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","status":"online","status_checked_at":"2025-10-10T02:00:06.843Z","response_time":62,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["euclidean-algorithm","rust"],"created_at":"2025-03-16T16:25:05.940Z","updated_at":"2025-10-10T15:07:29.014Z","avatar_url":"https://github.com/g4titanx.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# gcd_euclidean_algorithm\nthe program returns an integer solution to the equation `au + bv = gcd(a,b)`, a solution to exercise 1.12 of the book *An Introduction to Mathematical Cryptography* by *Jeffrey Hoffstein*.\n\n# the extended Euclidean algorithm theorem\nLet `a` and `b` be positive integers. Then the equation `au + bv = gcd(a,b)` always has `a` solution in integers `u` and `v`.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fg4titanx%2Fgcd_euclidean_algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fg4titanx%2Fgcd_euclidean_algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fg4titanx%2Fgcd_euclidean_algorithm/lists"}