Analysis of homomorphic properties of RSA-based cryptosystem for image sharing

Secret sharing between two or more parties, exploiting multiplicative homomorphic properties of RSA, may result in false data blocks during the extraction of message. This paper investigates factors that lead to such false blocks and suggest a controlled solution by analyzing their probability distribution. In this paper we prove that false blocks do exist and show that larger sizes of the prime product reduce the error probability of false blocks in extracted messages.