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 factoring.We show that the considered FHC is insecure against KPA 2009 buick lucerne catalytic converter even if only one pair (plaintext, ciphertext) was intercepted by an adversary.The complexity of the propo