About One Property of Number Rank in RNS
| Autor: | Mikhail Babenko, Elena Golimblevskaia |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
0209 industrial biotechnology
Computational complexity theory Modular arithmetic Computer science business.industry Homomorphic encryption Value (computer science) 02 engineering and technology Residue number system Encryption 020202 computer hardware & architecture 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering Rank (graph theory) business Chinese remainder theorem Algorithm Computer Science::Cryptography and Security |
| Zdroj: | 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus). |
| Popis: | an approximate value of the number rank is used to increase the speed of homomorphic encryption algorithms. The use of an approximate rank of a number allows reducing the computational complexity of the data encryption algorithm, but at the same time leads to a loss of accuracy. In this paper, we investigate the properties of the number rank. We have shown that it is possible to reduce the accuracy of calculating the approximate rank of a number, but the homomorphic encryption scheme will have the same properties. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|