Paper 2024/156
Homomorphic sign evaluation using functional bootstrapping with a RNS representation of integers
Abstract
In the context of fully-homomorphic-encryption, we consider the representation of large integers by their decomposition over a product of rings (through the Chinese Remainder Theorem) and introduce a new algorithm for the determination of the sign solely through the knowledge of ring-components. We then prove that our algorithm delivers a correct result with a very high probability.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Fully homomorphic encryptionBootstrappingBlind rotationResidue Number SystemSign determination
- Contact author(s)
-
philippe chartier @ raveltech io
michel koskas @ raveltech io
mohammed lemou @ raveltech io
florian mehats @ raveltech io - History
- 2024-02-05: approved
- 2024-02-02: received
- See all versions
- Short URL
- https://ia.cr/2024/156
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/156, author = {Philippe Chartier and Michel Koskas and Mohammed Lemou and Florian Méhats}, title = {Homomorphic sign evaluation using functional bootstrapping with a RNS representation of integers}, howpublished = {Cryptology ePrint Archive, Paper 2024/156}, year = {2024}, note = {\url{https://eprint.iacr.org/2024/156}}, url = {https://eprint.iacr.org/2024/156} }