By the same authors

ALGORITHMIC PROBLEMS IN ENGEL GROUPS AND CRYPTOGRAPHIC APPLICATIONS

Research output: Contribution to journalArticlepeer-review

Full text download(s)

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

JournalInternational Journal of Group Theory
DateAccepted/In press - 2020
DateE-pub ahead of print (current) - 8 Feb 2020
Number of pages18
Early online date8/02/20
Original languageEnglish

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.

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.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations