The entropy of a key generator for a symmetric cipher may be greatly reduced if there is redundancy in the algorithm applied. It may be possible for an attacker to use this reduction in entropy to conduct an exhaustive key attack on an otherwise secure encryption algorithm. In this paper a statistical method will be applied to estimate this entropy. This method can be applied in the case where the algorithm used to generate the key is unknown, only the actual keys are required.