checking time for a circuit of size in polynomial k
You've misunderstood.  They are saying that the running time to check all $2^k$ assignments (not the time to check one assignment) is $\Omega(2^k)$.  It's a reasonable misunderstanding, as their wording is unclear, but that's what they mean.