Exploring the advantages and challenges of Fermat NTT in FHE acceleration

DOI10.1007/978-3-031-68382-4_3MaRDI QIDQ6652893zbMATH OpenFDO

Authors Andrey Kim, Ahmet Can Mert, Anisha Mukherjee, Aikata Aikata, Maxim Deryabin, Sunmin Kwon, HyungChul Kang, Sujoy Sinha Roy

Publication date 13 December 2024

zbMATH Keywords

polynomial multiplierhardware acceleratorFermat numberFHENTT

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Hardware acceleration of NTT-based polynomial multiplication in CRYSTALS-Kyber
• Accelerating integer based fully homomorphic encryption using frequency domain multiplication
• An overview of torus fully homomorphic encryption
• Faster homomorphic encryption over GPGPUs via hierarchical DGT
• Accelerating LTV based homomorphic encryption in reconfigurable hardware

Cites work

• A full RNS variant of approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fast multiplication of large numbers
• Fast multiplication of polynomials over fields of characteristic 2
• Fast polynomial transform algorithms for digital convolution
• Faster binary-field multiplication and faster binary-field macs
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Generalized Fermat-Mersenne number theoretic transform
• On the Minimum Computation Time of Functions
• Speeding up the number theoretic transform for faster ideal lattice-based cryptography
• cuHE: a homomorphic encryption accelerator library

Cited in

(1)

• Hardware acceleration of NTT-based polynomial multiplication in CRYSTALS-Kyber

This page was built for publication: Exploring the advantages and challenges of Fermat NTT in FHE acceleration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652893)