Welcome to the resource topic for 2024/156
Homomorphic sign evaluation using functional bootstrapping with a RNS representation of integers
Authors: Philippe Chartier, Michel Koskas, Mohammed Lemou, Florian MéhatsAbstract:
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.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .