We explain and perform the steps for an (n,t) secret sharing scheme based onthe closest vector theorem. We then compare this scheme and its complexity to the secretsharing schemes of both Shamir and Panagopoulos. Finally we modify the (n,t) secretsharing scheme to a private key cryptosystem.