An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
From MaRDI portal
Publication:2109992
Recommendations
- High-throughput elliptic curve cryptography using AVX2 vector instructions
- Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
- Number theoretic transform: generalization, optimization, concrete analysis and applications
- Implementing the multiplication of polynomial matrices over the field GF(2) by means of the fast Fourier transform
- Faster arithmetic for number-theoretic transforms
Cites work
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Automatic parallel library generation for general-size modular FFT algorithms
- FFT algorithms for vector computers
- Faster arithmetic for number-theoretic transforms
- Modular Multiplication Without Trial Division
- The Fast Fourier Transform in a Finite Field
Cited in
(2)
This page was built for publication: An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109992)