Algorithmic problems in Engel groups and cryptographic applications
نویسندگان
1 Department of Mathematics (University of Salerno), Italy - Department of Mathematics and Statistic (University of the Basque Country), Spain
2 Department of Computer Science Deramore Lane, University of York
doi
10.22108/ijgt.2020.119123.1574چکیده
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.
