We design quantum resistant protocols for different cryptography problems, and determine their maximum efficiency, both theoretically, and in their implementation. Quantum computing is able to efficiently solve the factorization of integers and some cases of the discrete logarithm problem, therefore it makes encryptions based thereupon crackable. A new field of cryptography is post-quantum cryptography, which investigates protocols that are safe against quantum cracking. Among our aims are efficient and safe implementations of publicly known algorithms including ones requiring limited computational resources. We also aim at developing new protocols which are based on mathematical problems related to elliptic curves, meshes, class groups, etc., since these are currently believed to be resistant against quantum computers.