CHEHAB RL: Learning to Optimize Fully Homomorphic Encryption Computations
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917225132195840 |
|---|---|
| author | Sefsaf, Bilel Dandani, Abderraouf Seddiki, Abdessamed Mohammed, Arab Chielle, Eduardo Maniatakos, Michail Baghdadi, Riyadh |
| author_facet | Sefsaf, Bilel Dandani, Abderraouf Seddiki, Abdessamed Mohammed, Arab Chielle, Eduardo Maniatakos, Michail Baghdadi, Riyadh |
| contents | Fully Homomorphic Encryption (FHE) enables computations directly on encrypted data, but its high computational cost remains a significant barrier. Writing efficient FHE code is a complex task requiring cryptographic expertise, and finding the optimal sequence of program transformations is often intractable. In this paper, we propose CHEHAB RL, a novel framework that leverages deep reinforcement learning (RL) to automate FHE code optimization. Instead of relying on predefined heuristics or combinatorial search, our method trains an RL agent to learn an effective policy for applying a sequence of rewriting rules to automatically vectorize scalar FHE code while reducing instruction latency and noise growth. The proposed approach supports the optimization of both structured and unstructured code. To train the agent, we synthesize a diverse dataset of computations using a large language model (LLM). We integrate our proposed approach into the CHEHAB FHE compiler and evaluate it on a suite of benchmarks, comparing its performance against Coyote, a state-of-the-art vectorizing FHE compiler. The results show that our approach generates code that is $5.3\times$ faster in execution, accumulates $2.54\times$ less noise, while the compilation process itself is $27.9\times$ faster than Coyote (geometric means). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_19367 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | CHEHAB RL: Learning to Optimize Fully Homomorphic Encryption Computations Sefsaf, Bilel Dandani, Abderraouf Seddiki, Abdessamed Mohammed, Arab Chielle, Eduardo Maniatakos, Michail Baghdadi, Riyadh Cryptography and Security Machine Learning Fully Homomorphic Encryption (FHE) enables computations directly on encrypted data, but its high computational cost remains a significant barrier. Writing efficient FHE code is a complex task requiring cryptographic expertise, and finding the optimal sequence of program transformations is often intractable. In this paper, we propose CHEHAB RL, a novel framework that leverages deep reinforcement learning (RL) to automate FHE code optimization. Instead of relying on predefined heuristics or combinatorial search, our method trains an RL agent to learn an effective policy for applying a sequence of rewriting rules to automatically vectorize scalar FHE code while reducing instruction latency and noise growth. The proposed approach supports the optimization of both structured and unstructured code. To train the agent, we synthesize a diverse dataset of computations using a large language model (LLM). We integrate our proposed approach into the CHEHAB FHE compiler and evaluate it on a suite of benchmarks, comparing its performance against Coyote, a state-of-the-art vectorizing FHE compiler. The results show that our approach generates code that is $5.3\times$ faster in execution, accumulates $2.54\times$ less noise, while the compilation process itself is $27.9\times$ faster than Coyote (geometric means). |
| title | CHEHAB RL: Learning to Optimize Fully Homomorphic Encryption Computations |
| topic | Cryptography and Security Machine Learning |
| url | https://arxiv.org/abs/2601.19367 |