ポラード・ロー離散対数アルゴリズム
g ( x , n ) = { n x ∈ S 0 2 n ( mod p ) x ∈ S 1 n + 1 ( mod p ) x ∈ S 2 h ( x , n ) = { n + 1 ( mod p ) x ∈ S 0 2 n ( mod p ) x ∈ S 1 n x ∈ S 2 {\displaystyle {\begin{aligned}g(x,n)&={\begin{cases}n&x\in S_{0}\\2n\ ({\bmod {\ }}p)&x\in S_{1}\\n+1\ ({\bmod {\ }}p)&x\in S_{2}\end{cases}}\\h(x,n)&={\begin{cases}n+1\ ({\bmod {\ }}p)&x\in S_{0}\\2n\ ({\bmod {\ }}p)&x\in S_{1}\\n&x\in S_{2}\end{cases}}\end{aligned}}}
と定める。