Increased interest in applications of combinatorial group theory to cryptography First monograph exploring the area of „non-commutative cryptography“ Employing decision problems (as opposed to search problems) in public key cryptography allows to construct cryptographic protocols with new properties First presentation of a rigorous mathematical justification of security for protocols based on infinite groups, as an alternative to the security model known as semantic security Includes supplementary material: sn. pub/extras
