{"id":27376838,"url":"https://github.com/nikhilrout/ntt-fpga","last_synced_at":"2026-01-24T15:06:42.444Z","repository":{"id":256573129,"uuid":"855782137","full_name":"NikhilRout/NTT-FPGA","owner":"NikhilRout","description":"Verilog Implementation of the Number Theoretic Transform (NTT) and its inverse operation (INTT) utilizing modulo arithmetic for lattice-based PQC on FPGAs","archived":false,"fork":false,"pushed_at":"2025-02-19T08:53:47.000Z","size":1431,"stargazers_count":9,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-13T12:53:50.639Z","etag":null,"topics":["fpga","homomorphic-encryption","lattice-based-crypto","number-theoretic-transform","post-quantum-cryptography"],"latest_commit_sha":null,"homepage":"","language":"Verilog","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/NikhilRout.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2024-09-11T13:06:31.000Z","updated_at":"2025-04-03T10:13:47.000Z","dependencies_parsed_at":"2025-04-13T12:53:51.542Z","dependency_job_id":"6bc15fe1-95b6-426c-be58-0440b8268053","html_url":"https://github.com/NikhilRout/NTT-FPGA","commit_stats":null,"previous_names":["nikhilrout/ntt_fpga","nikhilrout/ntt-fpga"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/NikhilRout/NTT-FPGA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NikhilRout%2FNTT-FPGA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NikhilRout%2FNTT-FPGA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NikhilRout%2FNTT-FPGA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NikhilRout%2FNTT-FPGA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/NikhilRout","download_url":"https://codeload.github.com/NikhilRout/NTT-FPGA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NikhilRout%2FNTT-FPGA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28730309,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-24T10:24:43.181Z","status":"ssl_error","status_checked_at":"2026-01-24T10:24:36.112Z","response_time":89,"last_error":"SSL_read: 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":["fpga","homomorphic-encryption","lattice-based-crypto","number-theoretic-transform","post-quantum-cryptography"],"created_at":"2025-04-13T12:53:44.209Z","updated_at":"2026-01-24T15:06:42.416Z","avatar_url":"https://github.com/NikhilRout.png","language":"Verilog","funding_links":[],"categories":[],"sub_categories":[],"readme":"# NTT_FPGA\nVerilog Implementation of the Number Theoretic Transform (NTT) and its inverse operation (INTT), utilizing modulo arithmetic, for developing lattice-based Post Quantum Cryptography (PQC) and Homomorphic Encryption (HE) on FPGAs as desribed in the paper\n \u003e A. Satriawan, I. Syafalni, R. Mareta, I. Anshori, W. Shalannanda and A. Barra, \"Conceptual Review on Number Theoretic Transform and Comprehensive Review on Its Implementations,\" in IEEE Access, vol. 11, pp. 70288-70316, 2023, doi: 10.1109/ACCESS.2023.3294446\n\n# Worked Out Example\n## Number Theoretic Transform (NTT)\nA four-point NTT structure with **ψ** = 1925 in the ring **Z**\u003csub\u003e7681\u003c/sub\u003e is considered. A Cooley-Tukey butterfly unit based fast-NTT requires log\u003csub\u003e2\u003c/sub\u003e(n) stages. This implies our example shall need 2 stages\\. Inputs are in Normal order, Outputs are in Bit-reversed Order\\\n\\\n\u003cimg width=\"640\" alt=\"image\" src= \"https://github.com/user-attachments/assets/6e29ce19-14b7-4d09-b381-5b2e24c81306\"\u003e\n\n\n## Inverse Number Theoretic Transform (INTT)\nLikewise a four-point INTT structure based on Gentleman-Sande Butterfly units shall require 2 stages. Inputs are in Bit-reversed Order, Outputs are in Normal order\\\n\\\n\u003cimg width=\"640\" alt=\"image\" src= \"https://github.com/user-attachments/assets/659d9de8-f150-41b6-aec3-f22129ffeb58\"\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnikhilrout%2Fntt-fpga","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnikhilrout%2Fntt-fpga","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnikhilrout%2Fntt-fpga/lists"}