the push function finally crt rsa operations are executed by computing modulo operations based on the first prime and the second prime application_number US 201213585731 A description reference now should be made to the drawings throughout which the same reference numerals are used to designate the same or similar components embodiments of the present invention will be described in detail below with reference to the accompanying drawings fig1 is a diagram showing a crt rsa cryptography algorithm that is applied to the present invention as shown in fig1 the crt rsa cryptography algorithm that is applied to the present invention receives a message m to be sent a plurality of keys that is d primes p and q and z q u2212 1 mod p and also receives a randomly selected short prime r thereafter the value of d is calculated by computing d mod p u2212 1 r u2212 1 and the total cumulative value is calculated by performing an xor exclusive or operation on the values of p and r using a push function furthermore the value of d pr is calculated by computing d mod q u2212 1 r u2212 1 and the total cumulative value is calculated by performing an xor operation on the value of q using a push function here for a push function that is used to calculate the total cumulative value for the values of p q and r refer to fig2 fig2 illustrates the push function algorithm of the crt rsa cryptography algorithm which is applied to the present invention particularly the algorithm of the function push x y as shown in fig2 push x y performs an xor operation on.