OFHE: An Electro-Optical Accelerator for Discretized TFHE
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913356864028672 |
|---|---|
| author | Zheng, Mengxin Chu, Cheng Lou, Qian Youngblood, Nathan Li, Mo Moazeni, Sajjad Jiang, Lei |
| author_facet | Zheng, Mengxin Chu, Cheng Lou, Qian Youngblood, Nathan Li, Mo Moazeni, Sajjad Jiang, Lei |
| contents | This paper presents \textit{OFHE}, an electro-optical accelerator designed to process Discretized TFHE (DTFHE) operations, which encrypt multi-bit messages and support homomorphic multiplications, lookup table operations and full-domain functional bootstrappings. While DTFHE is more efficient and versatile than other fully homomorphic encryption schemes, it requires 32-, 64-, and 128-bit polynomial multiplications, which can be time-consuming. Existing TFHE accelerators are not easily upgradable to support DTFHE operations due to limited datapaths, a lack of datapath bit-width reconfigurability, and power inefficiencies when processing FFT and inverse FFT (IFFT) kernels. Compared to prior TFHE accelerators, OFHE addresses these challenges by improving the DTFHE operation latency by 8.7\%, the DTFHE operation throughput by $57\%$, and the DTFHE operation throughput per Watt by $94\%$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_11607 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | OFHE: An Electro-Optical Accelerator for Discretized TFHE Zheng, Mengxin Chu, Cheng Lou, Qian Youngblood, Nathan Li, Mo Moazeni, Sajjad Jiang, Lei Cryptography and Security Hardware Architecture This paper presents \textit{OFHE}, an electro-optical accelerator designed to process Discretized TFHE (DTFHE) operations, which encrypt multi-bit messages and support homomorphic multiplications, lookup table operations and full-domain functional bootstrappings. While DTFHE is more efficient and versatile than other fully homomorphic encryption schemes, it requires 32-, 64-, and 128-bit polynomial multiplications, which can be time-consuming. Existing TFHE accelerators are not easily upgradable to support DTFHE operations due to limited datapaths, a lack of datapath bit-width reconfigurability, and power inefficiencies when processing FFT and inverse FFT (IFFT) kernels. Compared to prior TFHE accelerators, OFHE addresses these challenges by improving the DTFHE operation latency by 8.7\%, the DTFHE operation throughput by $57\%$, and the DTFHE operation throughput per Watt by $94\%$. |
| title | OFHE: An Electro-Optical Accelerator for Discretized TFHE |
| topic | Cryptography and Security Hardware Architecture |
| url | https://arxiv.org/abs/2405.11607 |