On homomorphic encryption using abelian groups: Classical security analysis
share
In [15], Leonardi and Ruiz-Lopez propose an additively homomorphic public key encryption scheme whose security is expected to depend on the hardness of the learning homomorphism with noise problem (LHN). Choosing parameters for their primitive requires choosing three groups G, H, and K. In their paper, Leonardi and Ruiz-Lopez claim that, when G, H, and K are abelian, then their public key cryptosystem is not quantum secure. In this paper, we study security for finite abelian groups G, H, and K in the classical case. Moreover, we study quantum attacks on instantiations with solvable groups.
READ FULL TEXT