Cryptosystems Using Automorphisms of Finitely Generated Free Groups
Group Theory
2016-03-09 v1
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 of finite rank, the automorphism group 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.
Keywords
Cite
@article{arxiv.1603.02328,
title = {Cryptosystems Using Automorphisms of Finitely Generated Free Groups},
author = {Anja I. S. Moldenhauer and Gerhard Rosenberger},
journal= {arXiv preprint arXiv:1603.02328},
year = {2016}
}