Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Ciobanu, Laura / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year


CiteScore 2017: 0.32

SCImago Journal Rank (SJR) 2017: 0.208
Source Normalized Impact per Paper (SNIP) 2017: 0.322

Mathematical Citation Quotient (MCQ) 2017: 0.32

Online
ISSN
1869-6104
See all formats and pricing
More options …

Challenge response password security using combinatorial group theory

Gilbert Baumslag
  • Department of Computer Science, City College of New York, New York, NY 10031, United States. E-mail:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Yegor Bryukhov
  • Department of Computer Science, City College of New York, New York, NY 10031, United States. E-mail:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Benjamin Fine
  • Department of Mathematics, Fairfield University, Fairfield, Connecticut 06430, United States. E-mail:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Douglas Troeger
  • Department of Computer Science, City College of New York, New York, NY 10031, United States. E-mail:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
Published Online: 2010-06-23 | DOI: https://doi.org/10.1515/gcc.2010.005

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

About the article

Received: 2009-04-20

Revised: 2009-10-15

Published Online: 2010-06-23

Published in Print: 2010-06-01


Citation Information: Groups – Complexity – Cryptology, Volume 2, Issue 1, Pages 67–81, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc.2010.005.

Export Citation

Comments (0)

Please log in or register to comment.
Log in