Compare Group-based Cryptography

Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic prools based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant properties of some infinite groups that have been applied in public key cryptography so far. Its elementary exposition makes the book accessible to graduate as well as undergraduate students in mathematics or computer science.