Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
From MaRDI portal
Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
Recommendations
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- Number theoretic transform: generalization, optimization, concrete analysis and applications
- scientific article; zbMATH DE number 2085209
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
Cites work
- A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
- A method for obtaining digital signatures and public-key cryptosystems
- Fast multiplication of large numbers
- Faster integer multiplication
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- Integer multiplication in time \(O(n\log n)\)
- Modular Multiplication Without Trial Division
- The Fast Fourier Transform in a Finite Field
Cited in
(5)- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- scientific article; zbMATH DE number 4104356 (Why is no real title available?)
- Runtime code generation for constant-time secret-indexed array accesses: applications to PERK and NTRU
- A survey of polynomial multiplications for lattice-based cryptosystems
This page was built for publication: Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487413)
