Reema Patel, IS-2019,CE/ICT, SOT,PDPU 1

ASYMMETRIC HOMOMORPHIC
ALGORITHMS
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 2

Paillier cryptosystem – Key Generation

•
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 3

Carmichael function
• The Carmichael function is defined at to be the smallest
positive integer such that for all positive
integers a relatively prime to . The order of always
divides .

• This function is also known as the reduced totient function or

the least universal exponent function.
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 4

Paillier cryptosystem – Key Generation

• There are two ways of selecting the g.
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 5

Paillier cryptosystem – Key Generation

•
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 6

Paillier cryptosystem – Encryption

•
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 7

Paillier cryptosystem – Example

•
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 8

Paillier cryptosystem – Example

•
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 9

Paillier cryptosystem – Example

Encryption Decryption

Plaintext
25

Random
19
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 10

Paillier cryptosystem – Example

Encryption Decryption

Plaintext Ciphertext
25 {3390}

Random
19
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 11

Paillier cryptosystem – Example

Encryption Decryption

Plaintext Ciphertext Plaintext

25 {3390} 25

Random
19
 Reema Patel, IS-2019,CE/ICT, SOT,PDPU 12

Paillier – Homomorphic Property