HOMOMORPHISM OF RSA

AKIRA KOBASHI

1. Introduction The RSA algorithm [1] was publicly described in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT; the letters RSA are the initials of their surnames, listed in the same order as on the paper. Homomorphic encryption [2] is a form of encryption which allows specic types of computations to be carried out on ciphertext and obtain an encrypted result which decrypted matches the result of operations performed on the plaintext. For instance, one person could add two encrypted numbers and then another person could decrypt the result, without either of them being able to nd the value of the individual numbers. If the RSA public key is modulus m and exponent e, then the encryption of a message x is given by E (x) = xe mod m. The homomorphic property is then
e e E (x1 ) E (x2 ) = xe 1 x2 mod m = (x1 x2 ) mod m = E (x1 x2 )

2. RSA Encryption Choose two distinct prime numbers p and q. Compute n = p q . n is used as the modulus for both the public and private keys. Its length, usually expressed in bits, is the key length. Compute (n) = (p) (q ) = (p 1) (q 1) where is Eulers totient function. Choose an integer e such that 1 < e < (n) and gcd(e, (n)) = 1 e is released as the public key exponent. A variable m as a message, c me (mod n). To decrypt, d1 e (mod )(n)) and m cd (mod n) 3. Example of RSA Where n = p q, p = 61, q = 53, then n = p q = 3233 . (n) = (p) (q ) = (p 1) (q 1) then (n) = (9797) = 3120 1 < e < (n) and gcd(e, (n)) = 1 so that dene e = 17. gcd(e, (n)) = gcd(17, 3120) = 1 Assume m = 65 then c me
Date : Dec. 14. 2013.
1

(mod n)

AKIRA KOBASHI

, c 6517 (mod 3233) 2790 . This 2790 is a encrypted message. To decrypt 2790, we need d. d = e 1 , m cd . 4. RSA as Homomorphic Encryption Assume m1 = 65, m2 = 30 then c (m1 m2 )e
17 17

(mod (n)) = 171 (mod n) = 27902753

(mod 3120) 2753 (mod 3233) 65

(mod n)

c (30 65 ) (mod 3233) 1603 m 30 65 (mod n) = 195 mod 3233 1950 Actually 30 65 = 1950. This is RSA homomorphism. 5. Conclusion We described RSA homomorphism using an example. Readers may understand why RSA has homomorphism. References
[1] RSA (cryptosystem) :http://en.wikipedia.org/wiki/RSA (cryptosystem) [2] homomorphic encryption, http://en.wikipedia.org/wiki/Homomorphic encryption