Algorithmic problems in Engel groups and cryptographic applications
Publish place: International Journal of Group Theory، Vol: 9، Issue: 4
Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 184
This Paper With 20 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_THEGR-9-4_002
تاریخ نمایه سازی: 14 اردیبهشت 1400
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.
Keywords:
Authors
Delaram Kahrobaei
Department of Computer Science Deramore Lane, University of York
Marialaura Noce
Department of Mathematics (University of Salerno), Italy - Department of Mathematics and Statistic (University of the Basque Country), Spain