Interpreting approach for QPQ-CD. The selector uses the effective probability to select the best option. The effective probability is derived from the probability of extremity, probability of proximity, probability of a bit changed, probability of disorder and probability of penalties. All the curves studied use interpolation by Hermite polynomials as known as PCHIP (Piecewise Cubic Hermite Interpolating Polynomial). Probability of the extremity: The brute force attack is to browse all the possibilities in a random way is not profitably compared to the orderly way. According to the logic as well, an opponent wanting to test all possible keys using the brute force algorithm always starts with 00...000 up to 11...111 using increases or starting with 11...111 up to 00 ...000 using decreases. The closer the key is to 00 ... .000 or closer to 11 111, the lower the probability of not detecting the key. If the key is close to 0, the high-order one is difficult to detect. Because of this, the probability of not detecting the key if it is close to zero is defined by: If the key is close to 1, the high-order zero value bit is difficult to detect. Because of this, the probability of not detecting the key if it is close to one is defined by:
