Article
Licensed
Unlicensed
Requires Authentication
Challenge response password security using combinatorial group theory
-
Gilbert Baumslag
Published/Copyright:
June 23, 2010
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
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On Shephard groups with large triangles
- An update on Hurwitz groups
- Presentations of matrix rings
- The diameter of a random Cayley graph of ℤq
- Challenge response password security using combinatorial group theory
- The discrete logarithm problem in the group of non-singular circulant matrices
- Algebraic geometry over natural numbers. The classification of coordinate monoids
Keywords for this article
Password security;
combinatorial group theory;
free group cryptography;
group randomizer system
Articles in the same Issue
- On Shephard groups with large triangles
- An update on Hurwitz groups
- Presentations of matrix rings
- The diameter of a random Cayley graph of ℤq
- Challenge response password security using combinatorial group theory
- The discrete logarithm problem in the group of non-singular circulant matrices
- Algebraic geometry over natural numbers. The classification of coordinate monoids
