PARAMETRLI ALGEBRAGA ASOSLANGAN EL-GAMAL SHIFRLASH ALGORITMLARINI GOMOMORFIK XUSUSIYATINI TADQIQ ETISH

Abstract

Homomorphic encryption algorithms provide an opportunity to perform operations on encrypted data without decrypting them. This ensures the confidentiality of information. El-Gamal is a homomorphic encryption algorithm based on the discrete logarithmization problem. Currently available asymmetric encryption algorithms are based on complexities such as discrete logarithms, factorization and degree parameter in a finite field based on one-way functions. In the article, homomorphic properties of parameter encryption algorithms based on a one-way function, which are strong enough for the discrete logarithmization operation in a sufficiently large finite field, are studied.