FINDING N-TH ROOTS IN NILPOTENT GROUPS AND APPLICATIONS IN CRYPTOLOGY
Sandra Sze, Delaram Kahrobaei, Renald Dambreville, Makenson Dupas · International Journal of Pure and Apllied Mathematics · 2011
In this paper we discuss finding n-th roots in nilpotent groups and post some open questions. In the literature, the study of finding square root in finite fields has been of interest and because of the complexity of this problem, it has been used in public key cryptography. In this paper, we propose how to find the n-th root in nilpotent groups and propose a digital signature based on the semigroup law of 4-Engel groups.