Exploring the advantages and challenges of Fermat NTT in FHE acceleration
From MaRDI portal
Publication:6652893
DOI10.1007/978-3-031-68382-4_3MaRDI QIDQ6652893FDOQ6652893
Authors: Andrey Kim, Ahmet Can Mert, Anisha Mukherjee, Aikata Aikata, Maxim Deryabin, Sunmin Kwon, HyungChul Kang, Sujoy Sinha Roy 
Publication date: 13 December 2024
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
Data encryption (aspects in computer science) (68P25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)
Cites Work
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fast multiplication of polynomials over fields of characteristic 2
- Fast multiplication of large numbers
- On the Minimum Computation Time of Functions
- A full RNS variant of approximate homomorphic encryption
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- Faster binary-field multiplication and faster binary-field macs
- Fast polynomial transform algorithms for digital convolution
- Bootstrapping for approximate homomorphic encryption
- cuHE: a homomorphic encryption accelerator library
- Generalized Fermat-Mersenne number theoretic transform
Cited In (1)
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)
