Homomorphic sign evaluation using functional bootstrapping with a RNS representation of integers

ePrint Report: Homomorphic sign evaluation using functional bootstrapping with a RNS representation of integers

Philippe Chartier, Michel Koskas, Mohammed Lemou, Florian Méhats

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.

chinese context encryption eprint report evaluation large product report representation rings sign