Paper 2024/155
Fully Homomorphic Encryption on large integers
Abstract
At the core of fully homomorphic encryption lies a procedure to refresh the ciphertexts whose noise component has grown too big. The efficiency of the so-called bootstrap is of paramount importance as it is usually regarded as the main bottleneck towards a real-life deployment of fully homomorphic crypto-systems. In two of the fastest implementations so far, the space of messages is limited to binary
integers. If the message space is extended to the discretized torus
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Fully homomorphic encryptionPublic-key encryptionRing LWEbootstrappingblind rotationcollapse
- Contact author(s)
-
philippe chartier @ raveltech io
michel koskas @ raveltech io
mohammed lemou @ raveltech io
florian mehats @ raveltech io - History
- 2024-06-12: revised
- 2024-02-02: received
- See all versions
- Short URL
- https://ia.cr/2024/155
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/155, author = {Philippe Chartier and Michel Koskas and Mohammed Lemou and Florian Méhats}, title = {Fully Homomorphic Encryption on large integers}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/155}, year = {2024}, url = {https://eprint.iacr.org/2024/155} }