Blind recognition of cyclic code based on check matrix match algorithm is proposed in order to solve the blind identification issue of low fault tolerance rate and large intercepted data. First, the corresponding check matrix of all of the code length n and the factor of  xⁿ-1 is regarded as candidate check matrix. Second, a matrix is filled with intercepted bit stream received from binary symmetric channel. It is multipled with candidate check matrix, and whether check matrix in code length and synchronization exists or not is determined, and then code length, synchronization and generate polynomial can be estimated. The simulation results show that if the proposed method is applied to (63, 51) cyclic code, when the probability of correct recognition of code length, synchronization and generate polynomial requires 80%, the maximum bit error rate is 4.6×10^-2, 4.6×10^-2 and 1.6×10^-2 respectively.