{"id":19603879,"url":"https://github.com/dethada/quantum-cryptography","last_synced_at":"2025-04-27T19:32:27.843Z","repository":{"id":48151170,"uuid":"132759037","full_name":"Dethada/Quantum-Cryptography","owner":"Dethada","description":"😺 Classical implementation of shor's and grover's algorithm to help with understanding.","archived":false,"fork":false,"pushed_at":"2018-05-15T03:32:49.000Z","size":94,"stargazers_count":33,"open_issues_count":0,"forks_count":15,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-21T10:57:34.933Z","etag":null,"topics":["grovers-algorithm","quantum-cryptography","shors-algorithm"],"latest_commit_sha":null,"homepage":"","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/Dethada.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-05-09T13:12:59.000Z","updated_at":"2025-04-15T22:21:19.000Z","dependencies_parsed_at":"2022-08-25T09:01:54.531Z","dependency_job_id":null,"html_url":"https://github.com/Dethada/Quantum-Cryptography","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/Dethada%2FQuantum-Cryptography","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Dethada%2FQuantum-Cryptography/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Dethada%2FQuantum-Cryptography/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Dethada%2FQuantum-Cryptography/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Dethada","download_url":"https://codeload.github.com/Dethada/Quantum-Cryptography/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":251195910,"owners_count":21550866,"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":["grovers-algorithm","quantum-cryptography","shors-algorithm"],"created_at":"2024-11-11T09:33:23.610Z","updated_at":"2025-04-27T19:32:27.401Z","avatar_url":"https://github.com/Dethada.png","language":"Jupyter Notebook","readme":"# Quantum Cryptography\n\n## Shor's Algorithm\n\nPlease do not actually use classical_shor.py to try to factorize large numbers, it is a really inefficient way of factorization for a classical computer.\n\n```bash\npython3 -m timeit -s 'import classical_shor' 'classical_shor.solve(80609)'\n100 loops, best of 3: 3.11 msec per loop ((3.11 * 10^-3) seconds)\n```\n\npure_factorizatrion.py is a much better algorithm for finding primes on a classical computer.\n\n```bash\npython3 -m timeit -s 'import pure_factorization' 'pure_factorization.factorize(80609)'\n100000 loops, best of 3: 3.56 usec per loop ((3.56 * 10^-6) seconds)\n```\n\n* classical_shor.py\n  * Shor's algorithm implemented purely with classical algorithm\n* pure_factorization.py\n  * Classical way of finding prime factors\n\n## Grover's Algorithm\n\nReduces the time complexity of finding the input to a black box(Oracle) function that produces a particular output from O(N) to O(sqrt(N)).","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdethada%2Fquantum-cryptography","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdethada%2Fquantum-cryptography","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdethada%2Fquantum-cryptography/lists"}