{"id":15765195,"url":"https://github.com/grevend/shamirs-secret-sharing","last_synced_at":"2026-01-12T00:40:21.104Z","repository":{"id":63132970,"uuid":"534991835","full_name":"grevend/shamirs-secret-sharing","owner":"grevend","description":"Performant secret sharing scheme implementation based on polynomial interpolation over finite fields","archived":false,"fork":false,"pushed_at":"2023-12-15T02:37:58.000Z","size":50,"stargazers_count":0,"open_issues_count":4,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-23T06:14:10.379Z","etag":null,"topics":["assembly","c","deno","ffi","rdrand","secret-sharing","shamir"],"latest_commit_sha":null,"homepage":"https://deno.land/x/shamirs_secret_sharing","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/grevend.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","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":"2022-09-10T12:29:46.000Z","updated_at":"2022-11-15T19:50:23.000Z","dependencies_parsed_at":"2024-10-25T12:46:05.430Z","dependency_job_id":"f1527e8d-de96-4301-9993-4f3b9a106d00","html_url":"https://github.com/grevend/shamirs-secret-sharing","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/grevend/shamirs-secret-sharing","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grevend%2Fshamirs-secret-sharing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grevend%2Fshamirs-secret-sharing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grevend%2Fshamirs-secret-sharing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grevend%2Fshamirs-secret-sharing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/grevend","download_url":"https://codeload.github.com/grevend/shamirs-secret-sharing/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grevend%2Fshamirs-secret-sharing/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28329806,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-12T00:36:25.062Z","status":"ssl_error","status_checked_at":"2026-01-12T00:36:15.229Z","response_time":60,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6: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":["assembly","c","deno","ffi","rdrand","secret-sharing","shamir"],"created_at":"2024-10-04T12:24:54.001Z","updated_at":"2026-01-12T00:40:21.089Z","avatar_url":"https://github.com/grevend.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Shamir’s Secret-Sharing Scheme\n\nA preponderance of the open-source Shamir’s Secret-Sharing Scheme implementations operate on a finite field $\\mathbb{F}_q$, where $q$ is dependent on both the secret size as well as the number of shares, thus requiring both the search for a sufficiently large prime as well as the support of a large enough number representation or chunking of the secret. This implementation outlines an optimized low-level c and inline assembly-based alternative that uses the Galois field $2^8$, referred to as GF(256), along with a Reed-Solomon inspired encoding approach and a hardware-accelerated entropy sourced secure number generator to offer the theoretical capacity to process secrets up to 8 Exabytes.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrevend%2Fshamirs-secret-sharing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgrevend%2Fshamirs-secret-sharing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrevend%2Fshamirs-secret-sharing/lists"}