arXiv:1603.02328 [math.GR]AbstractReferencesReviewsResources
Cryptosystems Using Automorphisms of Finitely Generated Free Groups
Anja I. S. Moldenhauer, Gerhard Rosenberger
Published 2016-03-07Version 1
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.
Categories: math.GR
Related articles: Most relevant | Search more
The Automorphism Group of a Finite p-Group is Almost Always a p-Group
arXiv:0711.2816 [math.GR] (Published 2007-11-18)
Automorphism Groups of Finite p-Groups: Structure and Applications
arXiv:math/9711203 [math.GR] (Published 1997-11-24)
The automorphism tower of a free group