Polynomial multiplication

Efficient Homomorphic Integer Computer from CKKS

Efficient Homomorphic Integer Computer from CKKS

A deep dive into the hardware design and implementation of HQC, a post-quantum cryptography scheme. The talk covers performance and security bottlenecks, detailing novel solutions for efficient polynomial multiplication by leveraging sparsity and constant-time methods for generating fixed-weight vectors to thwart side-channel attacks.