Algorithmic problems in Engel groups and cryptographic applications

2020/01/30 by Delaram Kahrobaei, Marialaura Noce, Kahrobaei, Delaram +1
Computer Science · Engineering · Mathematics · #20F45 #94A60 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2001.11577

openalex publication_date 2020/01/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Engelsche Elemente Noetherscher Gruppen
• How to share a secret
• What is the Probability that Two Group Elements Commute?

Related

• Problems in group theory motivated by cryptography
• Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems
• Group theory in cryptography
• Algorithmic problems in right-angled Artin groups: complexity and applications
• Public key cryptography based on some extensions of group