- Faculty, Mathematics
- group theory, commutative algebra, cryptography, complexity algorithms
GAGTA Book 1
This book shows new directions in group theory motivated by computer science. It reflects the transition from geometric group theory to group theory of the 21st century that has strong connections to computer science. Now that geometric group theory is drifting further and further away from group theory to geometry, it is natural to look for new tools and new directions in group theory which are present.
This book includes works by well-known experts in the field and will be of interest to mathematicians working in group theory and related areas.
Published June 2020
This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public-key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols 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. This book also describes new interesting developments in the algorithmic theory of solvable groups and another spectacular new development related to complexity of group-theoretic problems, which is based on the ideas of compressed words and straight-line programs coming from computer science.
Published November 2011
American Mathematical Society, 2011
(Advanced Courses in Mathematics - CRM Barcelona)
This first monograph to fathom non-commutative cryptography permits the construction of cryptographic protocols, with rigorous mathematical justification. The coauthors explore relations between three areas of mathematics and theoretical computer science: complexity theory, cryptography, and combinatorial group theory. The book is intended for computer scientists and mathematicians, and for both graduate students and undergraduates.
Published July 2008