I motsetning til [[Generic Group Model]], får motstanderen her eksplisitt tilgang til gruppen $G$. [TCC:AueHofPas23 - Generic-group lower bounds viea reductions between geometric-search problems: With and without preprocessing](https://eprint.iacr.org/2023/808) skriver (p.4): > While an algorithm with input $g_0, \dots, g_k \in \mathbb{G}$ in the AGM gets explicit access to the group $\mathbb{G}$, it has to provide an algebraic justification for every element $h \in \mathbb{G}$ that it outputs. More precisely, together with $h$, it has to produce $a_0, \dots, a_k \in \mathbb{Z}_p$ such that $h = \Pi^k_{i = 0} g^{a_i}_i$.