Publication 2007 Issue No. 9 - September Abstract - Reconstruction of a Linear Scrambler
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Mathieu Cluzeau
Reconstruction of a Linear Scrambler
September 2007 (vol. 56 no. 9)
pp. 1283-1291
 ASCII Text x Mathieu Cluzeau, "Reconstruction of a Linear Scrambler," IEEE Transactions on Computers, vol. 56, no. 9, pp. 1283-1291, September, 2007.
 BibTex x @article{ 10.1109/TC.2007.1055,author = {Mathieu Cluzeau},title = {Reconstruction of a Linear Scrambler},journal ={IEEE Transactions on Computers},volume = {56},number = {9},issn = {0018-9340},year = {2007},pages = {1283-1291},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.1055},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Reconstruction of a Linear ScramblerIS - 9SN - 0018-9340SP1283EP1291EPD - 1283-1291A1 - Mathieu Cluzeau, PY - 2007KW - Communication systemKW - scramblerKW - linear feedback shift registerKW - reconstructionVL - 56JA - IEEE Transactions on ComputersER -
We present different techniques to reconstruct a linear scrambler from the knowledge of a large segment of the output stream according to various assumptions on the input stream. We also present some algebraic methods to reconstruct a synchronous scrambler when its output is known up to a linear transformation per block only.

[1] B. Rice, “Determining the Parameters of a Rate ${{1}\over{n}}$ Convolutional Encoder over $GF(q)$ ,” Proc. Third Int'l Conf. Finite Fields and Applications, 1995.
[2] E. Filiol, “Reconstruction of Convolutional Encoders over $GF(q)$ ,” Proc. Sixth IMA Conf. Cryptography and Coding, 1997.
[3] E. Filiol, “Reconstruction of Punctured Convolutional Encoders,” Proc. IEEE Int'l Symp. Information Theory and Applications (ISITA '00), 2000.
[4] A. Valembois, “Detection and Recognition of a Binary Linear Code,” Discrete Applied Math., vol. 111, pp. 199-218, 2001.
[5] R. Lidl and H. Niederreiter, Finite Fields. Cambridge Univ. Press, 1983.
[6] J. Massey, “Shift-Register Synthesis and BCH Decoding,” IEEE Trans. Information Theory, vol. 15, pp. 122-127, Jan. 1969.
[7] A. Canteaut and E. Filiol, “Ciphertext Only Reconstruction of Stream Ciphers Based on Combination Generators,” Proc. Seventh Int'l Workshop Fast Software Encryption (FSE '00), pp. 165-180, 2000.
[8] A. Canteaut and M. Trabbia, “Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '00), pp. 573-588, 2000.
[9] W. Meier and O. Staffelbach, “Fast Correlation Attack on Certain Stream Ciphers,” J. Cryptology, vol. 1, no. 3, pp. 159-176, 1989.
[10] V. Chepyshov, T. Johansson, and B. Smeets, “A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers,” Proc. Seventh Int'l Workshop Fast Software Encryption (FSE '00), pp. 181-195, 2000.
[11] T. Johansson and F. Jönsson, “Fast Correlation Attacks through Reconstruction of Linear Polynomials,” Proc. 20th Ann. Int'l Cryptology Conf. (Crypto '00), pp. 300-315, 2000.

Index Terms:
Communication system, scrambler, linear feedback shift register, reconstruction
Citation:
Mathieu Cluzeau, "Reconstruction of a Linear Scrambler," IEEE Transactions on Computers, vol. 56, no. 9, pp. 1283-1291, Sept. 2007, doi:10.1109/TC.2007.1055