Algorithmic problems in Engel groups and cryptographic applications
Group Theory
2020-02-03 v1
Abstract
The theory of Engel groups plays an important role in group theory since these groups are closely related to the Burnside problems. In this survey we consider several classical and novel algorithmic problems for Engel groups and propose several open problems. We study these problems with a view towards applications to cryptography.
Cite
@article{arxiv.2001.11577,
title = {Algorithmic problems in Engel groups and cryptographic applications},
author = {Delaram Kahrobaei and Marialaura Noce},
journal= {arXiv preprint arXiv:2001.11577},
year = {2020}
}