Showing a limited preview of this publication:
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.
Keywords.: Password security; combinatorial group theory; free group cryptography; group randomizer system
Received: 2009-04-20
Revised: 2009-10-15
Published Online: 2010-06-23
Published in Print: 2010-June
© de Gruyter 2010