Prime-field DLOG ⇒ efficiently represented DLOG
Statement
A group generator for which DLOG is hard in is one for which DLOG is hard in efficiently represented groups, with the same advantage: and are mutually inverse bijections between and , and they and multiplication modulo are computable in deterministic polynomial time — folklore.