Algorithmic problems in Engel groups and cryptographic applications

Marialaura Noce, Delaram Kahrobaei

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)231-250
Number of pages20
JournalInternational Journal of Group Theory
Volume9
Issue number4
DOIs
Publication statusAcceptance date - 8 Feb 2020

Keywords

  • Algorithmic problems
  • Cryptography
  • Engel elements

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this