Blind identification of feedback polynomials for synchronous scramblers in a noisy environment

This paper investigates blind identification methods for linear scramblers under noncooperative conditions, which are essential for the inverse analysis of communication protocols using scramblers. In this paper, a blind identification scheme for feedback polynomials of synchronous scramblers is proposed. A variable. is first proposed that measures the correctness of the test polynomial by using the soft information of the received sequence, then the mean and variance of the variable. in different cases are obtained, and finally the optimal threshold value to determine whether the test primitive polynomial is correct or not is obtained. That is, the blind identification problem is transformed into a hypothesis testing problem. The simulations verify that the proposed scheme requires a much smaller scrambled sequence length than existing blind identification schemes. Furthermore, the proposed scheme is more fault tolerant than existing schemes and has a signal-to-noise ratio (SNR) gain of at least 3 dB when the intercepted scrambled sequences are of the same length and high identification accuracy is achieved.