ALGORITHMIC PROBLEMS IN ENGEL GROUPS AND CRYPTOGRAPHIC APPLICATIONS

Delaram Kahrobaei, Marialaura Noce

Research output: Contribution to journalArticlepeer-review

Abstract

The theory of Engel groups plays an important role in group theory since they 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 cryptog- raphy.
Original languageEnglish
Number of pages18
JournalInternational Journal of Group Theory
Early online date8 Feb 2020
DOIs
Publication statusE-pub ahead of print - 8 Feb 2020

Bibliographical note

© 2020 University of Isfahan. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.

Cite this