Examines the relationship between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups 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.
Kundinnen und Kunden meinen
0.0/5.0
0 Bewertungen
Verfassen Sie die erste Bewertung zu diesem Artikel