One plaintext attack on the BFV scheme

Abstract

The issue of data security is one of the key issues of using homomorphic data encryption algorithms. In this article, we investigate the computational indistinguishability of the homomorphic encryption scheme BFV. We propose a scenario in which attackers can find out the secret key, which can potentially lead to information leakage. We show that the postulate of the BFV scheme to increase the level of security by introducing an additional error is erroneous