Multiple Group Action Dlogs with(out) Precomputation

ePrint Report: Multiple Group Action Dlogs with(out) Precomputation

Alexander May, Massimo Ostuzzi

Let $\star: G \times X \rightarrow X$ be the action of a group $G$ of size $N=|G|$ on a set $X$. Let $y = g \star x \in X$ be a group action dlog instance, where our goal is to compute the unknown group element $g \in G$ from the known set elements $x,y \in X$.
The Galbraith-Hess-Smart (GHS) collision finding algorithm solves the group action dlog in …

action compute eprint report goal instance may report size star