Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/123456789/29356
Title: An Approximate Algorithm for Determining the Sign Function of a Number Using Neural Network Methods
Authors: Shiriaev, E. M.
Ширяев, Е. М.
Lutsenko, V. V.
Луценко, В. В.
Babenko, M. G.
Бабенко, М. Г.
Keywords: Homomorphic encryption;Sign function;Residue number system (RNS);Neural networks
Issue Date: 2024
Publisher: Springer Science and Business Media Deutschland GmbH
Citation: Shiriaev, E., Lutsenko, V., Babenko, M. An Approximate Algorithm for Determining the Sign Function of a Number Using Neural Network Methods // Lecture Notes in Networks and Systems. - 2025. - 1207 LNNS. - pp. 247-255. - DOI: 10.1007/978-3-031-77229-0_25
Series/Report no.: Lecture Notes in Networks and Systems
Abstract: Determining the sign of a number is not as simple as addition and multiplication. When using the traditional notation of a number in binary form with two's complement code, it allows you to store the sign of the number and process it. However, when representing a number in modular form, or in any other forms, for example, in the form of a homomorphic cipher, where the operation of determining the sign cannot be performed explicitly. In such cases, it is necessary to resort to various computationally complex methods. In this work, we are conducting research on the possibility of using neural networks to calculate an approximate function of the sign of a number, this will reduce the computational costs of traditional approaches to determining the sign.
URI: https://dspace.ncfu.ru/handle/123456789/29356
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File SizeFormat 
scopusresults 3359.pdf
  Restricted Access
132.54 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.