Hardware-Friendly Randomization: Enabling Random-Access and Minimal Wiring in FHE Accelerators with Low Total Cost
Ilan Rosenfeld (1), Noam Kleinburd (1), Hillel Chapman (1), Dror Reuven (1) ((1) Chain Reaction, Ltd.)

TL;DR
This paper introduces a hardware-friendly randomization scheme for FHE accelerators that reduces wiring complexity, power consumption, and communication overhead while maintaining high parallelism and security.
Contribution
It presents a concrete scheme enabling efficient on-the-fly polynomial generation with minimal wiring and power overhead, improving hardware implementation of FHE schemes.
Findings
Reduces client-side overhead to less than 3%.
Eliminates the need for thick metal layers for randomness distribution.
Prevents power scaling of the PRNG subsystem, saving tens of Watts.
Abstract
The Ring-Learning With Errors (RLWE) problem forms the backbone of highly efficient Fully Homomorphic Encryption (FHE) schemes. A significant component of the RLWE public key and ciphertext of the form is the uniformly random polynomial . While essential for security, the communication overhead of transmitting from client to server, and inputting it into a hardware accelerator, can be substantial, especially for FHE accelerators aiming at high acceleration factors. A known technique in reducing this overhead generates from a small seed on the client side via a deterministic process, transmits only the seed, and generates on-the-fly within the accelerator. Challenges in the hardware implementation of an accelerator include wiring (density and power), compute area, compute power as well as flexibility in scheduling of on-the-fly generation instructions.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Cryptography and Residue Arithmetic · Cryptographic Implementations and Security
