{"id":24653090,"url":"https://github.com/lattice-based-cryptography/ntt","last_synced_at":"2025-03-20T23:28:55.533Z","repository":{"id":273936395,"uuid":"921362668","full_name":"lattice-based-cryptography/ntt","owner":"lattice-based-cryptography","description":"Implementation of the number theoretic transform in Rust.","archived":false,"fork":false,"pushed_at":"2025-02-18T02:08:24.000Z","size":75,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-12T00:11:53.609Z","etag":null,"topics":["fourier-transform","ntt","number-theory"],"latest_commit_sha":null,"homepage":"https://crates.io/crates/ntt","language":"Rust","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/lattice-based-cryptography.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}},"created_at":"2025-01-23T20:11:41.000Z","updated_at":"2025-02-21T21:55:18.000Z","dependencies_parsed_at":"2025-02-05T20:36:30.923Z","dependency_job_id":"98614f0c-1aa9-4d73-b96f-6e7e790691d4","html_url":"https://github.com/lattice-based-cryptography/ntt","commit_stats":null,"previous_names":["jacksonwalters/ntt","lattice-based-cryptography/ntt"],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lattice-based-cryptography%2Fntt","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lattice-based-cryptography%2Fntt/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lattice-based-cryptography%2Fntt/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lattice-based-cryptography%2Fntt/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lattice-based-cryptography","download_url":"https://codeload.github.com/lattice-based-cryptography/ntt/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244709178,"owners_count":20497023,"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":["fourier-transform","ntt","number-theory"],"created_at":"2025-01-25T20:13:47.476Z","updated_at":"2025-03-20T23:28:55.528Z","avatar_url":"https://github.com/lattice-based-cryptography.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ntt\n![CI](https://github.com/jacksonwalters/ntt/actions/workflows/ci.yml/badge.svg)\n![MIT License](https://img.shields.io/badge/License-MIT-brightgreen)\n[![crates.io](https://img.shields.io/crates/v/ntt.svg)](https://crates.io/crates/ntt)\n\n\nImplementation of the number theoretic transform (NTT) in Rust.\n\nThe NTT is a DFT over the ring Z/mZ. We use a fast divide-and conquer algorithm. The array size `n` must be a power of two. \n\nWe allow composite moduli as long as `n` divides `phi(p^e)` for each prime factor p of the modulus, where `phi` is the Euler totient.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flattice-based-cryptography%2Fntt","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flattice-based-cryptography%2Fntt","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flattice-based-cryptography%2Fntt/lists"}