A set A of primes p involving numbers such as abt + c, where |a|, |b|, |c| = O(1) and t → ∞, is defined. An algorithm for computing discrete logs in the finite field of order p with p ∈ A is suggested. Its heuristic expected running time is Lp[ 1 3 ; ( 32 9 )1/3] for ( 32 9 )1/3 = 1.526 · · · , where Lp[α;β] = exp((β + o(1)) ln α p(ln ln p)1−α) as p → ∞, 0 < α < 1, and 0 < β. At present, the mo...