Since we know that Homomorphic encryption allow computation on encrypted data. Let two n-bit integers $(x,y)$ are encrypted using some LWE public key cryptography. For example - if $x'= HEnc(x,pk)$ and $y'= HEnc(y,pk)$, Finding $Max(x',y')$ or $Min(x',y')$ or $Equal(x',y')$ the above comparison is necessary.
Now, we need to perform comparison (>=
,==
) operation homomorphically. How can we do this? Can anyone describe this with example?