Title

Secure Passwords Using Combinatorial Group Theory

Authors

Gilbert Baumslag
Benjamin Fine, Fairfield UniversityFollow
Anja Moldenhauer
Gerhard Rosenberger

Document Type

Article

Article Version

Publisher's PDF

Publication Date

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.

Comments

Copyright 2018 the Authors

This work is licensed under a Creative Commons Attribution License.

The final publisher PDF has been archived here with permission from the copyright holder.

Publication Title

Journal of Information Security

Repository Citation

Baumslag, Gilbert; Fine, Benjamin; Moldenhauer, Anja; and Rosenberger, Gerhard, "Secure Passwords Using Combinatorial Group Theory" (2018). Mathematics Faculty Publications. 59.
https://digitalcommons.fairfield.edu/mathandcomputerscience-facultypubs/59

Published Citation

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

DOI

10.4236/jis.2018.92011