A RECTENNA MODEL BASED ON MOSFETS FOR MICROWAVE ENERGY HARVESTING AT ULTRA-LOW POWER LEVELS

This article considers a symmetric probabilistic homomorphic Domingo-Ferrer cryptosystem basedon the problem of number factorization. Currently, homomorphic cryptosystems of two types are relevant:the Gentry type and those based on the problem of factorization of numbers. A distinctive feature of thelatter, in comparison with Gentry-type cryptosystems, is the lower complexity of performing homomorphicoperations, which significantly expands the scope of their application in practice. However, sincehomomorphic cryptosystems based on the number factorization problem have not been widely used andhave not been sufficiently analyzed, unlike Gentry-type cryptosystems, their thorough comprehensive studyis required. For the considered symmetric homomorphic Domingo-Ferrer cryptosystem, descriptions ofkey generation, encryption, decryption, and homomorphic computing operations are given. For encryption,decryption, and homomorphic computing operations, a complexity estimate is given, expressed in thenumber of basic mathematical operations, as well as graphs illustrating the dependence of the number ofoperations on the selected parameters of the cryptosystem. The aim of the study is to assess the complexityof performing encryption, decryption and homomorphic calculations by a symmetric probabilistichomomorphic Domingo-Ferrer cryptosystem based on the number factorization problem. The main resultof this work is an assessment of the complexity and determination of the most time-consuming stages ofencryption, decryption and performing homomorphic calculations using the Domingo-Ferrer cipher, confirmedby a number of experimental studies. The conducted research represents an important step in thedevelopment of the Domingo-Ferrer cryptographic system based on the problem of factorization of numbersand has the practical significance of implementing algorithms with the ability to determine the timecosts of encryption, decryption and performing homomorphic calculations. The results obtained can beused by researchers and programmers in the development of implementations of the Domingo-Ferrercryptosystem in programming languages.