Towards unsecurity of two homomorphic encryptions based on residue system

The security of two recently proposed symmetric homomorphic encryption schemes based on residue system is analyzed.
Both schemes have a high computational efficiency since using residue system naturally allows parallelizing computations. So they could be good candidates to protect the data in clouds. But to the best of our knowledge there is a lack of security analysis for these encryption schemes.
It should be noted that the first cryptosystem under our consideration was already considered in literature.
The sketch of adaptive chosen-plaintext attack was proposed and estimation of its success was given.
In this paper the attack is analyzed and it is shown that in some cases it may work incorrectly. Also more general algorithm of known-plaintext attack is presented.  Theoretical estimations of probability to recover the key using it and practical estimations of this probability obtained during the experiments are provided.
The security of the second cryptosystem has not been analyzed yet and we fill this gap for known-plaintext attack.  The dependency between the number of «plaintext, ciphertext» pairs required to recover the key and parameters of the cryptosystem is analyzed. Also some recommendations for increasing the security level are provided.
The final conclusion of our analysis is that both cryptosystems are vulnerable to known-plaintext attack. And it may be dangerous to encrypt private data using them.
Finally it should be noted that the key element of the proposed attacks is the algorithm of computing the greatest common divisor. So their computational complexity depends polynomially on the size of input data.