Methods for the reconstruction of parallel turbo codes

We present two new algorithms for the reconstruction of turbo codes from a noisy intercepted bitstream. With these algorithms, we were able to reconstruct various turbo codes with realistic parameter sizes. To the best of our knowledge, these are the first algorithms able to recover the whole permutation of a turbo code in the presence of high noise levels.

[1]  Jean-Pierre Tillich,et al.  On the code reverse engineering problem , 2008, 2008 IEEE International Symposium on Information Theory.

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

[3]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[4]  Nicolas Sendrier,et al.  Reconstruction of a turbo-code interleaver from noisy observation , 2010, 2010 IEEE International Symposium on Information Theory.

[5]  G. Burel,et al.  Blind Estimation of Encoder and Interleaver Characteristics in a Non Cooperative Context , 2003 .

[6]  Antoine Joux,et al.  Fast Correlation Attacks: An Algorithmic Point of View , 2002, EUROCRYPT.

[7]  Johann Barbier,et al.  Reconstruction of turbo-code encoders , 2005, SPIE Defense + Commercial Sensing.

[8]  Anne Canteaut,et al.  A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .

[9]  F. Chabaud,et al.  A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to Primitive Narrow-Sense BCH Codes of Length~511 , 1995 .

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

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

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

[13]  R. Gallager.  Information Theory and Reliable Communication , 1968 .