Secure Passwords Using Combinatorial Group Theory

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

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: Journal of Information Security
DOI: 10.4236/jis.2018.92011 (PDF)
Paper Id: 83166 (metadata)

See also: Comments to Paper

About scirp

(SCIRP: is an academic publisher of open access journals. It also publishes academic books and conference proceedings. SCIRP currently has more than 200 open access journals in the areas of science, technology and medicine. Readers can download papers for free and enjoy reuse rights based on a Creative Commons license. Authors hold copyright with no restrictions. SCIRP calculates different metrics on article and journal level. Citations of published papers are shown based on Google Scholar and CrossRef. Most of our journals have been indexed by several world class databases. All papers are archived by PORTICO to guarantee their availability for centuries to come.
This entry was posted in JIS. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *