When NTT meets Karatsuba: preprocess-then-NTT technique revisited

DOI10.1007/978-3-030-88052-1_15zbMath1500.94064OpenAlexW2982379075MaRDI QIDQ2672460

Yanyan Li

Publication date: 8 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88052-1_15

zbMATH Keywords

polynomialmultiplicationring learning with errorsNTT

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• SWIFFT
• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number theoretic transform: generalization, optimization, concrete analysis and applications
• Compact and simple RLWE based key encapsulation mechanism
• Preprocess-then-NTT Technique and its applications to Kyber and NewHope
• Worst-case to average-case reductions for module lattices
• (Leveled) fully homomorphic encryption without bootstrapping
• Lattice Signatures without Trapdoors
• Fast polynomial transform algorithms for digital convolution
• SWIFFT: A Modest Proposal for FFT Hashing
• On Ideal Lattices and Learning with Errors over Rings
• An Algorithm for the Machine Calculation of Complex Fourier Series
• On the Minimum Computation Time of Functions
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: When NTT meets Karatsuba: preprocess-then-NTT technique revisited