CryptoDB
Homomorphic sign evaluation with a RNS representation of integers
| Authors: |
|
|---|---|
| Download: | |
| Conference: | ASIACRYPT 2024 |
| 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. Our implementation with 128 bits of security delivers a correct result and a probability higher than 1-1.e-9 in less than 100 milliseconds for 32-bit integers on a laptop. |
BibTeX
@inproceedings{asiacrypt-2024-34532,
title={Homomorphic sign evaluation with a RNS representation of integers},
publisher={Springer-Verlag},
author={Philippe Chartier and Michel Koskas and Mohammed Lemou and Florian Méhats},
year=2024
}