An implementation of parallel number-theoretic transform using Intel AVX-512 instructions

DOI10.1007/978-3-031-14788-3_18OpenAlexW4298363122MaRDI QIDQ2109992FDOQ2109992

Authors: Daisuke Takahashi 

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-14788-3_18

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

zbMATH Keywords

modular multiplicationnumber-theoretic transformIntel AVX-512 instructions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Modular Multiplication Without Trial Division
• Title not available (Why is that?)
• The Fast Fourier Transform in a Finite Field
• FFT algorithms for vector computers
• Faster arithmetic for number-theoretic transforms
• Automatic Parallel Library Generation for General-Size Modular FFT Algorithms

Cited In (1)

• Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms

Uses Software

• NTL
• libclang
• GitHub

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)