EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

Ggh class of public-key cryptosystems relies on computational problems based on the closest vector problem (cvp) in lattices for their security. the subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. we present eeh, a ggh-like public key cryptosystem based on the eisenstein integers z [ζ3] where ζ3 is a primitive cube root of unity. eeh applies representations of polynomials to the ggh encryption scheme and we discuss its key size and parameters selection. we also provide theoretical and experimental data to compare the security and efficiency of eeh to ggh with comparable parameter sets and show that eeh is an improvement over ggh in terms of security and efficiency.