Primitive root-finding problem
Suppose is a finite group specified by means of a suitable group description rule (typically, an encoding), and we are given a promise that is a finite cyclic group. In other words, we can think of as a black-box cyclic group (though there may be more contextual structure known about ). The goal is to obtain an explicit description of a single element such that . Such an element is termed a primitive root in some contexts.