Challenge response password security using combinatorial group theory

Abstract Challenge response methods are increasingly used to enhance password security. In this paper we present a very secure method for challenge response password verification using combinatorial group theory. This method, which relies on the group randomizer system, a subset of the MAGNUS computer algebra system, handles most of the present problems with challenge response systems. Theoretical security is based on several results in asymptotic group theory.