Borovik, A., Myasnikov, A.G. and Shpilrain, V. (2002) Measuring Sets in Infinite Groups. In: Gilman, R., Shpilrain, V. and Myasnikov, A.G., Eds., Computational and Statistical Group Theory, Contemporary Mathematics, Vol. 298, 21-42.
https://doi.org/10.1090/conm/298/05112

has been cited by the following article:

• TITLE: Secure Passwords Using Combinatorial Group Theory

  AUTHORS: Gilbert Baumslag, Benjamin Fine, Anja Moldenhauer, Gerhard Rosenberger

  KEYWORDS: Password Security, Combinatorial Group Theory, Free Group Cryptography, Group Randomizer System

  JOURNAL NAME: Journal of Information Security, Vol.9 No.2, March 21, 2018

  ABSTRACT: Password security is a crucial component of modern internet security. In this paper, we present a provably secure method for password verification using combinatorial group theory. This method relies on the group randomizer system, a subset of the MAGNUS computer algebra system and corrects most of the present problems with challenge response systems, the most common types of password verification. Theoretical security of the considered method depends on several results in asymptotic group theory. We mention further that this method has applications for many other password situations including container security.