{"id":17798898,"url":"https://github.com/sukumar1210/ntrupy","last_synced_at":"2025-04-02T03:41:58.363Z","repository":{"id":209423584,"uuid":"724021305","full_name":"sukumar1210/NTRUpy","owner":"sukumar1210","description":"NTRU (N'th Degree Truncated Polynomial Ring Unit) is a Post Quantum Cryptographic System. Post-Quantum refers to the Cryptographic Encryption and Decryption that could be used after the widespread access to the Quantum computers become common.","archived":false,"fork":false,"pushed_at":"2024-02-15T06:52:42.000Z","size":58,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-07T18:24:30.449Z","etag":null,"topics":["cryptography","quantum","security"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sukumar1210.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","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":"2023-11-27T08:31:39.000Z","updated_at":"2024-02-22T19:19:49.000Z","dependencies_parsed_at":"2024-10-27T12:07:04.683Z","dependency_job_id":"086901f9-a779-40ed-96d8-0facecb7efc1","html_url":"https://github.com/sukumar1210/NTRUpy","commit_stats":null,"previous_names":["sukumar1210/ntrypy","sukumar1210/ntrupy"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sukumar1210%2FNTRUpy","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sukumar1210%2FNTRUpy/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sukumar1210%2FNTRUpy/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sukumar1210%2FNTRUpy/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sukumar1210","download_url":"https://codeload.github.com/sukumar1210/NTRUpy/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246752607,"owners_count":20827987,"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":["cryptography","quantum","security"],"created_at":"2024-10-27T12:02:21.726Z","updated_at":"2025-04-02T03:41:58.344Z","avatar_url":"https://github.com/sukumar1210.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Table of contents \n- [What is NTRU?](#what-is-ntru)\n- [Usage of this Python Module](#module-usage)\n- [Docs](#other-docs)\n\t- [Algorithm](./Docs/NTRU%20Algorithm.md)\n\t- [Mathematical Requirements](./Docs/Required%20Mathematics%20for%20NTRU.md)\n# What is NTRU?\n[NTRU](https://en.wikipedia.org/wiki/NTRU) (N'th Degree Truncated Polynomial Ring Unit) is a Post Quantum Cryptographic System. Post-Quantum refers to the Cryptographic Encryption and Decryption that could be used after the widespread access to the Quantum computers become common.\n## Need for a different (Post-Quantum) Cryptographic System.\nThe Current Cryptographic systems work on the NP-Hard problem of Factoring products of large Prime numbers, i.e. the difficulty and complexity of factorising the products of two large prime numbers is non-computable for a classical computer system.\n#### Problem\nThese Classical Cryptographic systems can be broken using a quantum computer as the product of the large prime numbers can be factorised using [Shor's Algorithm](https://en.wikipedia.org/wiki/Shor%27s_algorithm#:~:text=%22Shor's%20algorithm%22%20usually%20refers%20to,of%20the%20hidden%20subgroup%20problem.) on a Quantum Computer.\n#### Solution\nThe solution is to come up with a different Cryptographic System which is based on either a different NP-Hard Problem or a completely different mathematical paradigm which maps the plain-text to the cipher-text in a manner which is not traceable.\n# Module Usage\nTBC\n# Other Docs\n- [NTRU Algorithm](./Docs/NTRU%20Algorithm.md)\n\t- Key-Generation\n\t- Encryption\n\t- Decryption","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsukumar1210%2Fntrupy","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsukumar1210%2Fntrupy","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsukumar1210%2Fntrupy/lists"}