Fast Multipliers for Number Theoretic Transforms
From MaRDI portal
Publication:4158935
DOI10.1109/TC.1978.1675187zbMATH Open0379.94008OpenAlexW2151552725MaRDI QIDQ4158935FDOQ4158935
Publication date: 1978
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1978.1675187
Recommendations
- Residue number system implementations of number theoretic transforms in complex residue rings
- [[:Publication:3704820|Title not available (Why is that?)]]
- Faster arithmetic for number-theoretic transforms
- [[:Publication:3313766|Title not available (Why is that?)]]
- Fast Fourier transformation based on number theoretic transforms
Numerical methods for trigonometric approximation and interpolation (65T40) Communication theory (94A05) Mathematical problems of computer architecture (68M07)
Cited In (11)
- Fast arithmetic with general Gauß periods
- Title not available (Why is that?)
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- Fast Zeta Transforms for Lattices with Few Irreducibles
- Title not available (Why is that?)
- Multiple radix fast Fourier transformation based on number theoretic transforms
- The shifted number system for fast linear algebra on integer matrices
- Fast Library for Number Theory: An Introduction
- Speedable Left-c.e. Numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Fast Multipliers for Number Theoretic Transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158935)