|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
An Efficient Method for Comparing Numbers and Determining the Sign of a Number in RNS for Even Rangesстатья
- Авторы: Tchernykh A., Babenko M., Shiriaev E., Pulido-Gaytan B., Cortés-Mendoza J.M., Avetisyan A., Drozdov A.Y., Kuchukov V.
- Журнал: Research on Language and Computation
- Том: 10
- Номер: 2
- Год издания: 2022
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- DOI: 10.3390/computation10020017
- Аннотация: Fully Homomorphic Encryption (FHE) permits processing information in the form of ciphertexts without decryption. It can ensure the security of information in common technologies used today, such as cloud computing, the Internet of Things, and machine learning, among others. A primary disadvantage for its practical application is the low efficiency of sign and comparison operations. Several FHE schemes use the Residue Number System (RNS) to decrease the time complexity of these operations. Converting from the RNS to the positional number system and calculating the positional characteristic of a number are standard approaches for both operations in the RNS domain. In this paper, we propose a new method for comparing numbers and determining the sign of a number in RNS. We focus on the even ranges that are computationally simple due to their peculiarities. We compare the performance of several state-of-art algorithms based on an implementation in C++ and relatively simple moduli with a bit depth from 24 to 64 bits. The experimental analysis shows a better performance of our approach for all the test cases; it improves the sign detection between 1.93 and 15.3 times and the number comparison within 1.55–11.35 times with respect to all the methods and configurations.
- Добавил в систему: Аветисян Арутюн Ишханович