{
  "id": "1603.02328",
  "version": "v1",
  "published": "2016-03-07T22:36:15.000Z",
  "updated": "2016-03-07T22:36:15.000Z",
  "title": "Cryptosystems Using Automorphisms of Finitely Generated Free Groups",
  "authors": [
    "Anja I. S. Moldenhauer",
    "Gerhard Rosenberger"
  ],
  "categories": [
    "math.GR"
  ],
  "abstract": "This paper introduces a newly developed private key cryptosystem and a public key cryptosystem. In the first one, each letter is encrypted with a different key. Therefore, it is a kind of a one-time pad. The second one is inspired by the ElGamal cryptosystem. Both presented cryptosystems are based on automorphisms of free groups. Given a free group $F$ of finite rank, the automorphism group $Aut(F)$ can be generated by Nielsen transformations, which are the basis of a linear technique to study free groups and general infinite groups. Therefore Nielsen transformations are introduced.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-03-07T22:36:15.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20E36",
      "20E05",
      "94A60"
    ],
    "keywords": [
      "finitely generated free groups",
      "nielsen transformations",
      "general infinite groups",
      "study free groups",
      "automorphism group"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}