Not checkedNot checked for notices yet.
Algorithmic problems in Engel groups and cryptographic applications
Delaram Kahrobaei, Marialaura Noce
International Journal of Group Theory · 2020
doi:10.22108/ijgt.2020.119123.1574 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.