src_e53adb99e40ae66258
- Source-provided label
- Not reported
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 05, 2026 18:48 UTC
- Retrieved
- Oct 08, 2026 03:46 UTC
Automorphism-Compatible NTT and its Application to Homomorphic Encryption
ePrint Report: Automorphism-Compatible NTT and its Application to Homomorphic Encryption Charanjit S. Jutla, Nathan Manohar, Guy Moshkowich For $N$ a power of $2$, the negacyclic number-theoretic transform (NTT) maps a degree $N-1$ polynomial to its evaluations at the $N$ primitive $2N$th roots of unity. In-place butterfly algorithms such as Cooley-Tukey and Gentleman-Sande compute the negacyclic
Reference details
- Source category
- Research & news
- Report title
Automorphism-Compatible NTT and its Application to Homomorphic Encryption- First reported
- Oct 05, 2026 18:48 UTC
- Last reported
- Oct 05, 2026 18:48 UTC
- Catalog updated
- Oct 08, 2026 03:46 UTC
- Record ID
90ae66e8c71eab2e0abe7ac2ff4c936a14cc410218a55487703e5b82436510dd
Published indicators
Network indicators are visibly defanged. This page does not make them clickable or send them to another service.
No validated file hashes or network indicators are stored for this record.
Source observations
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Feed collection status
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
1 sources: 0 stale, 0 needing attention, 0 paused, 1 unverified.
Review source update dates and status
- src_e53adb99e40ae66258Collection status unverifiedLast successful batch: Unverified
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.