We investigate and compare several constructions of pseudorandom number generators based on block ciphers in counter mode. An idealized models of those constructions are considered, where the block ciphers are assumed to be random permutations. For these models we compute lower and upper bounds for conditional probabilities for the next element to appear given a prefix. We also consider a few criteria to evaluate generators output sequence and then compare generators to each other by one of these criteria.