Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Challenge response password security using combinatorial group theory

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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Challenge response password security using combinatorial group theory

Download PDF
15 pages

Loading next page...
 
/lp/de-gruyter/challenge-response-password-security-using-combinatorial-group-theory-bNFotAwFIA

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2010 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc.2010.005
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Groups - Complexity - Cryptology – de Gruyter

Published: Jun 1, 2010

There are no references for this article.