The Lattice Isomorphism Problem (LIP) involves finding an isometry between two given lattices. In recent years, LIP has emerged as a fundamental assumption for constructing quantum-resistant cryptographic primitives. In this presentation, we explore some of these constructions and introduce LIP as a hardness assumption to build public key encryption schemes.