In the recent times, the demand for the security measures increased manifold that can thwart the attacks on the information shared between two nodes over the computer network. Encrypting the data in the sending machine is the one traditional method using either the symmetric key or the public key cryptosystems. In addition to information protection during the transmission, the additional need to secure the data during the processing at the either sides of the network is also intensifying. Addressing this issue, in this paper, we propose a new asymmetric cryptosystem involving randomization in the encryption and also bring out the partial homomorphic properties. On the other hand, the decryption procedure, in the proposed scheme, is based on multiplicative cyclic groups and their corresponding of p- Sylow subgroups assumption. Determination of the corresponding plaintext element from the randomized enciphered ciphertext element is made through the p-Sylow subgroups. The performance of the proposed scheme is found to be good as compared to the RSA-1024, in spite the attaining large integer space during randomization and homomorphism. The strength of the cipher in terms of intractability is also excellent given the fewer number of bits in the private key.
Volume 10 | Issue 9
Pages: 416-426