Please use this identifier to cite or link to this item:
https://dspace.ncfu.ru/handle/20.500.12258/15890
Title: | Efficient Implementation of the CKKS scheme using a quadratic residue number system |
Authors: | Shiriaev, E. M. Ширяев, Е. М. Nazarov, A. S. Назаров, А. С. Kucherov, N. N. Кучеров, Н. Н. Sotikova, N. A. Сотикова, Н. А. |
Keywords: | Quadratic residual class system;Residual class system;Chinese remainder theorem;Data coding;Homomorphic encryption;Cryptography |
Issue Date: | 2021 |
Publisher: | Institute of Electrical and Electronics Engineers Inc. |
Citation: | Efficient Implementation of the CKKS scheme using a quadratic residue number system // Proceedings of the 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2021. - 2021. - Pages 665 - 669. - Номер статьи 9396482 |
Series/Report no.: | Proceedings of the 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2021 |
Abstract: | The use of homomorphic encryption to ensure computational security imposes additional overhead associated with encryption and decryption of data. One of the mechanisms that can be used to increase the data coding rate is the quadratic residue number system. The quadratic residue number system reduces the number of decimal multiplications by half when multiplying two complex numbers. However, the use of a quadratic residue number system imposes a number of restrictions related to the representation of a number. In this article, we propose a mechanism for choosing the parameters of a quadratic residue number system and develop an efficient data encoding algorithm |
URI: | http://hdl.handle.net/20.500.12258/15890 |
Appears in Collections: | Статьи, проиндексированные в SCOPUS, WOS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
scopusresults 1675 .pdf Restricted Access | 889.95 kB | Adobe PDF | View/Open | |
WoS 1207 .pdf Restricted Access | 140.67 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.