论文标题
恩格尔组和密码应用的算法问题
Algorithmic problems in Engel groups and cryptographic applications
论文作者
论文摘要
恩格尔小组的理论在群体理论中起着重要作用，因为这些群体与伯恩赛德问题密切相关。在这项调查中，我们考虑了恩格尔小组的几种古典和新颖的算法问题，并提出了几个开放问题。我们研究了这些问题，以对密码学的应用进行观点。
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.
