About Cryptanalysis of One Fully Homomorphic Cryptosystem Based on Factorization Problem
We present a known plaintext attack (KPA) on a recently proposed fully homomorphic cryptosystem (FHC), based on the problem of big integers Outerwear Women’s STS factoring.We show that the considered FHC is insecure against KPA even if only one pair (plaintext, ciphertext) was intercepted by Scooters an adversary.The complexity of the proposed KP