Computing system for fully homomorphic encryption applications using parallelizable hybrid bootstrapping

The hybrid bootstrapping technique addresses the performance bottleneck of FHE by parallelizing bootstrapping operations across multiple FPGAs, achieving significant speedup and efficient noise reduction in FHE computations.

WO2025188478A1 Publication Date: 2025-09-11TRUSTEES OF BOSTON UNIV
3 Cites 0 Cited by

Patent Information

Application Number
PCT/US2025/016312
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-03-07
Filing Date
2025-02-18
Publication Date
2025-09-11

AI Technical Summary

Technical Problem

Existing fully homomorphic encryption (FHE) schemes face performance bottlenecks due to the expensive and sequential nature of the bootstrapping operation, limiting practical use and scalability on multi-compute platforms.

Method used

A hybrid bootstrapping technique that extracts coefficients from a single RLWE ciphertext to represent multiple LWE ciphertexts, allowing parallel execution of blind rotate operations, which are independent and can be performed across multiple computing units, such as FPGAs, to reduce noise and recreate the original ciphertext representation.

Benefits of technology

This approach achieves a 15x speedup compared to state-of-the-art single and multiple FPGA implementations, enabling efficient and scalable FHE computations by reducing noise and maintaining data integrity.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

A computing system includes accelerator devices for hardware acceleration of operations of a fully homomorphic encryption (FHE) application, including a hybrid bootstrapping operation that may be parallelized for increased performance. Hybrid bootstrapping includes a first extraction on a first ciphertext (e.g., Ring Learning with Errors or RLWE) to form a plurality of second ciphertexts (e.g., LWE) corresponding to respective elements of the encrypted data, and a plurality of blind-rotate operations performed independently on the respective second ciphertexts to collectively produce a plurality of third ciphertexts (e.g., RLWE). A second extraction of respective elements of the third ciphertexts forms a plurality of fourth ciphertexts (e.g., LWE), and a repacking of respective elements of the fourth ciphertexts recreates the first-ciphertext representation of the encrypted data with restored modulus and reduced noise.
Need to check novelty before this filing date? Find Prior Art