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.
Journal of Information Security
Baumslag, Gilbert; Fine, Benjamin; Moldenhauer, Anja; and Rosenberger, Gerhard, "Secure Passwords Using Combinatorial Group Theory" (2018). Mathematics Faculty Publications. 59.
Baumslag, G., Fine, B., Moldenhauer, A., & Rosenberger, G. (2018). Secure Passwords Using Combinatorial Group Theory. Journal of Information Security, 9(2), 154. https://doi.org/10.4236/jis.2018.92011