A Study on Reconstruction of Linear Scrambler Using Dual Words of Channel Encoder

In this paper, the reconstruction of the feedback polynomial as well as the initial state of a linear feedback shift register (LFSR) in a synchronous scrambler placed after a channel encoder is studied. The study is first based on the assumption that the channel is noiseless and then extended to the noisy channel condition. The dual words, which are orthogonal to the codewords generated by the channel encoder, are used in the reconstruction algorithm. The number of bits required by the new algorithm is compared with another recently proposed algorithm and results show that the number of bits required to do the reconstruction can be significantly reduced.

[1]  Pål K. Frenger,et al.  Convolutional codes with optimum distance spectrum , 1999, IEEE Communications Letters.

[2]  Mathieu Cluzeau,et al.  Block code reconstruction using iterative decoding techniques , 2006, 2006 IEEE International Symposium on Information Theory.

[3]  Matthieu Finiasz,et al.  Recovering a code's length and synchronization from a noisy intercepted bitstream , 2009, 2009 IEEE International Symposium on Information Theory.

[4]  R. Gautier,et al.  Blind estimation of scrambler offset using encoder redundancy , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[5]  Xin-Wen Wu,et al.  Reconstructing a Linear Scrambler With Improved Detection Capability and in the Presence of Noise , 2012, IEEE Transactions on Information Forensics and Security.

[6]  Matthieu Finiasz,et al.  Reconstruction of punctured convolutional codes , 2009, 2009 IEEE Information Theory Workshop.

[7]  Antoine Valembois,et al.  Detection and recognition of a binary linear code , 2001, Discret. Appl. Math..

[8]  Nicolas Sendrier,et al.  Reconstruction of convolutional codes from noisy observation , 2009, 2009 IEEE International Symposium on Information Theory.

[9]  Mathieu Cluzeau,et al.  Reconstruction of a Linear Scrambler , 2007, IEEE Transactions on Computers.

[10]  Willi Meier,et al.  Fast correlation attacks on certain stream ciphers , 1989, Journal of Cryptology.

[11]  Chen Wanzhi.  An improved algorithm for fast correlation attack on stream ciphers , 2008, 2008 7th World Congress on Intelligent Control and Automation.

[12]  Eric Filiol,et al.  Decimation Attack of Stream Ciphers , 2000, INDOCRYPT.

[13]  Vladimir V. Chepyzhov,et al.  On A Fast Correlation Attack on Certain Stream Ciphers , 1991, EUROCRYPT.

[14]  Hiroyuki Ishii,et al.  An adaptive receiver based on software defined radio techniques , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

[15]  Willi Meier,et al.  Fast Correlation Attacks on Stream Ciphers (Extended Abstract) , 1988, EUROCRYPT.

[16]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[17]  Angela Doufexi,et al.  Adaptive MIMO OFDMA for Future Generation Cellular Systems in a Realistic Outdoor Environment , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[18]  Sebastien Houcke,et al.  Algebraic Approach for the Reconstruction of Linear and Convolutional Error Correcting Codes , 2008 .

[19]  Xin-Wen Wu,et al.  Primitive polynomials for robust scramblers and stream ciphers against reverse engineering , 2010, 2010 IEEE International Symposium on Information Theory.

[20]  Ryuji Kohno,et al.  Blind adaptive estimation of modulation scheme for software defined radio , 2000, 11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications. PIMRC 2000. Proceedings (Cat. No.00TH8525).

[21]  Janis Dingel,et al.  Parameter Estimation of a Convolutional Encoder from Noisy Observations , 2007, 2007 IEEE International Symposium on Information Theory.