About Cryptanalysis of One Fully Homomorphic Cryptosystem Based on Factorization Problem

About Cryptanalysis of One Fully Homomorphic Cryptosystem Based on Factorization Problem

Blog Article

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 even if only one pair Cherry Fruit (Tart (plaintext, ciphertext) was intercepted by an adversary.The complexity of the proposed KPA depends polynomially on the parameters of FHC and logarithmically on the size of plaintexts space.Also we discuss how ciphertexts only attack Denim (COA) on this FHC may be reduced to KPA.