About one property of number rank in RNS

Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/20.500.12258/15891

Title:	About one property of number rank in RNS
Authors:	Babenko, M. G. Бабенко, М. Г. Golimblevskaia, E. I. Голимблевская, Е. И.
Keywords:	Number rank;Residue number system (RNS);Chinese remainder theorem;Homomorphic encryption;Modular arithmetic;Cryptography
Issue Date:	2021
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Citation:	Babenko M., Golimblevskaia E. About one property of number rank in RNS // Proceedings of the 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2021. - 2021. - Pages 212 - 216. - Номер статьи 9396072
Series/Report no.:	Proceedings of the 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2021
Abstract:	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
URI:	http://hdl.handle.net/20.500.12258/15891
Appears in Collections:	Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:

File	Description	Size	Format
scopusresults 1676 .pdf Restricted Access		900.35 kB	Adobe PDF	View/Open
WoS 1194 .pdf Restricted Access		140.39 kB	Adobe PDF	View/Open

Репозиторий научных и учебно-методических публикаций