Algebraic methods in cryptography

The schemes in public-key cryptography involved mainly abelian groups and their security relied on hardness of the integer factoring and of the discrete logarithm problems. Design of the quantum algorithms for these problems has caused some anxiety in the cryptographic community and inspired further search for other cryptographic schemes. It is supposed to discuss alternative approaches based on non-abelian groups.