À. Titre-de-référence, nous avons appliqué le même algorithme à une séquence (z) résultant non plus du filtrage de la séquence PN par la fonction, mais du bruitage de cette séquence par un canal binaire symétrique ; nous avons choisi la probabilité de transition du canal de telle sorte qu

L. and S. J. Anderson, Searching for the optimum correlation attack, Lectures Notes in Computer Science, vol.1008, issue.1, pp.137-143, 1995.
DOI : 10.1007/3-540-60590-8_11

G. Ars and J. Faugere, Gröbner attack of Nonlinear Filter Generator with a small number of Key bits

L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.2, pp.284-287, 1974.
DOI : 10.1109/TIT.1974.1055186

C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1, Proceedings of ICC '93, IEEE International Conference on Communications, pp.1064-1070, 1993.
DOI : 10.1109/ICC.1993.397441

J. J. Boutros, Turbo codes parallèles et séries. Décodages SISO Itératif et Performances ML

P. Camion, C. Carlet, P. Charpin, and N. Sendrier, On Correlation-immune functions, Lecture Notes in Computer Science, vol.576, pp.86-100, 1992.
DOI : 10.1007/3-540-46766-1_6

P. Camion and A. Canteaut, Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography, Designs, Codes and Cryptography, issue.16, pp.121-149, 1999.

A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine, Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions, Lecture Notes in Computer Science, vol.1807, pp.507-522, 2000.
DOI : 10.1007/3-540-45539-6_36

A. Canteaut, Attaques de cryptosystèmes à mots de poids faible et construction de fonctions t-résilientes, Thèse de doctorat de l

A. Canteaut and M. Trabbia, Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5, Lecture Notes in Computer Science, vol.1807, pp.573-588, 2000.
DOI : 10.1007/3-540-45539-6_40

A. Canteaut and E. Filiol, On the Influence of the Filtering Function on the Performance of Fast Correlation Attacks on Filter Generators, 23rd Symposium on Information Theory in the Benelux, 2002.

A. Canteaut and P. Charpin, Decomposing bent function, IEEE Transactions on Information Theory, vol.49, issue.8, 2003.
DOI : 10.1109/tit.2003.814476

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.8026

J. Chen and M. Fossorier, Near Optimum Universal Belief Propagation Based Decoding of Low-Density Parity Check Codes, IEEE Transactions on Communications

V. V. Chepyzhov, T. Johansson, and B. Smeets, A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers, Fast Software Encryption Lecture Notes in Computer Science, pp.181-195, 1978.
DOI : 10.1007/3-540-44706-7_13

P. Chose, A. Joux, and M. Mitton, Fast Correlation Attacks: An Algorithmic Point of View, Lecture Notes in Computer Science, vol.2332, pp.209-221, 2002.
DOI : 10.1007/3-540-46035-7_14

A. Clark, J. Dj, E. Golic, and . Dawson, A comparison of fast correlation attacks, Fast Software Encryption Lecture Notes in Computer Science, pp.145-157, 1996.
DOI : 10.1007/3-540-60865-6_50

T. M. Cover and J. A. , Thomas : Elements of information theory Wiley series in Telecommunications, 1991.

N. Courtois, Fast Algebraic Attacks on Stream Ciphers with Linear Feedback, Lecture Notes in Computer Science, vol.2729, pp.177-194, 2003.
DOI : 10.1007/978-3-540-45146-4_11

N. Courtois and W. Meier, Algebraic Attacks on Stream Ciphers with Linear Feedback Advances in Cryptology -Eurocrypt, Lecture Notes in Computer Science, pp.345-359, 2003.

E. Dawson, J. Goli?, W. Millan, L. Penna, and L. Simpson, The LILI-128 keystream generator, Proceedings of the First NESSIE Conference, 2000.

J. Faugère and G. Ars, An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner bases, 2003.

M. Fedorova and Y. Tarannikov, On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices, pp.254-266, 2001.
DOI : 10.1007/3-540-45311-3_24

C. Fontaine, Contribution à la recherche de fonctions booléennes hautement non linéaires, et au marquage d'images en vue de la protection des droits d'auteur, 1998.

G. D. Forney, The viterbi algorithm, Proceedings of the IEEE, vol.61, issue.3, pp.268-278, 1973.
DOI : 10.1109/PROC.1973.9030

G. D. Forney, Codes on graphs: normal realizations, IEEE Transactions on Information Theory, vol.47, issue.2, pp.520-548, 2001.
DOI : 10.1109/18.910573

M. Fossorier and S. Lin, Soft-Decision Decoding of Linear Block Codes Based on Ordered Statistics, IEEE Transactions on Information Theory, pp.411379-1396, 1995.

M. Fossorier and S. Lin, Computationally efficient soft-decision decoding of linear block codes based on ordered statistics, IEEE Transactions on Information Theory, vol.42, issue.3, pp.42-738, 1996.
DOI : 10.1109/18.490541

M. Fossorier, M. Mihaljevì-c, and H. Imai, Reduced complexity iterative decoding of low-density parity check codes based on belief propagation, IEEE Transactions on Communications, vol.47, issue.5, pp.47-673, 1999.
DOI : 10.1109/26.768759

M. Fossorier and S. Lin, Reliability-based information set decoding of binary linear codes, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), pp.2034-2042, 1999.
DOI : 10.1109/ISIT.1998.708833

M. Fossorier, M. Mihaljevì-c, and H. Imai, Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications, Lecture Notes in Computer Sciences, vol.1719, pp.282-293, 1999.
DOI : 10.1007/3-540-46796-3_28

R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, pp.21-28, 1962.
DOI : 10.1109/TIT.1962.1057683

E. Garrido, Communication interne

E. Garrido and C. Poli, Communication interne

J. Golic and M. Mihaljevì-c, A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance, Journal of Cryptology, vol.34, issue.3, pp.201-212, 1991.
DOI : 10.1007/BF00196912

J. Golic, Computation of low-weight parity-check polynomials, Electronics Letters, vol.32, issue.21, pp.1981-1982, 1996.
DOI : 10.1049/el:19961338

J. Golic, On the Security of Nonlinear Filter Generators Fast Software Encryption, Lecture Notes in Computer Science, pp.173-188, 1996.

J. Golic, A. Clark, and E. Dawson, Generalized inversion attack on nonlinear filter generators, IEEE Transactions on computers, vol.49, issue.10, 2000.

P. Guillot, Fonctions courbes binaires et transformation de Möbius, thèse de doctorat, université de Caen, 1999.

J. Hagenauer, E. Offer, and L. Papke, Iterative decoding of binary block and convolutional codes, IEEE Transactions on Information Theory, vol.42, issue.2, pp.429-445, 1996.
DOI : 10.1109/18.485714

R. Johanesson, K. Sh, and . Zygangirov, Fundamentals of Convolutionnal Coding, 1999.

T. Johansson and F. Jönsson, Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes, Lecture Notes in Computer Science, vol.1592, pp.347-362, 1999.
DOI : 10.1007/3-540-48910-X_24

T. Johansson and F. Jönsson, Fast Correlation Attacks Based on Turbo Code Techniques, Lecture Notes in Computer Science, vol.1666, pp.181-197, 1999.
DOI : 10.1007/3-540-48405-1_12

T. Johansson and F. Jönsson, Fast Correlation Attacks through Reconstruction of Linear Polynomials, Lecture Notes in Computer Science, vol.1880, pp.300-315, 2000.
DOI : 10.1007/3-540-44598-6_19

T. Johansson and F. Jönsson, Theoretical analysis of a correlation attack based on convolutional codes, IEEE Transactions on Information Theory, vol.48, issue.8, pp.2173-2181, 2002.
DOI : 10.1109/TIT.2002.800494

T. Johansson and F. Jönsson, On the complexity of some cryptographic problems based on the general decoding problem, IEEE Transactions on Information Theory, vol.48, issue.10, pp.2669-2678, 2002.
DOI : 10.1109/TIT.2002.802608

F. Jönsson and T. Johansson, A fast correlation attack on LILI-128, Information Processing Letters, vol.81, issue.3, pp.127-132, 2002.
DOI : 10.1016/S0020-0190(01)00208-3

F. Jönsson, Some results on fast correlation attacks, p.230, 2002.

F. R. Kschischang, B. J. Frey, and H. Loeliger, Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory, vol.47, issue.2, pp.458-519, 2001.
DOI : 10.1109/18.910572

J. Leon, A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Transactions on Information Theory, vol.34, issue.5, pp.1354-1359, 1988.
DOI : 10.1109/18.21270

S. Leveiller, J. Boutros, P. Guillot, and G. Zémor, Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding, IMA Int. Conf, pp.402-414, 2001.

S. Leveiller, G. Zémor, P. Guillot, and J. Boutros, A new cryptanalytic attack on PNgenerators filtered by a Boolean function, Selected Areas on Cryptography-2002 Lecture Notes in Computer Science, pp.232-249
DOI : 10.1007/3-540-36492-7_16

S. Leveiller, Cryptanalysis of nonlinear filter registers through probability-matching, 2003.

R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Math. and Its Appl, vol.20, 1983.
DOI : 10.1017/CBO9780511525926

R. Lucas, M. Fossorier, Y. Kou, and S. Lin, Iterative Decoding of One-Step Majority Logic Decodable Codes Based on Belief Propagation, IEEE Transactions on Communications, pp.48-931, 2000.

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes, 1977.

D. J. Mackay and R. M. Neal, Near Shannon limit performance of low density parity check codes, Electronics Letters, vol.32, issue.18, pp.1645-1646, 1996.
DOI : 10.1049/el:19961141

D. J. Mackay, Good error-correcting codes based on very sparse matrices, IEEE Transactions on Information Theory, vol.45, issue.2, 1999.
DOI : 10.1109/18.748992

M. Matsui, Linear Cryptanalysis Method for DES Cipher, Lecture Notes in Computer Science, vol.765, pp.386-397, 1993.
DOI : 10.1007/3-540-48285-7_33

R. J. Mceliece, D. J. Mackay, and J. Chenf, Turbo decoding as an instance of Pearl's "belief propagation" algorithm, IEEE Journal on Selected Areas in Communications, vol.16, issue.2, pp.140-152, 1998.
DOI : 10.1109/49.661103

W. Meier and O. Staffelbach, Fast correlation attacks on certain stream ciphers, Journal of Cryptology, vol.34, issue.3, pp.159-176, 1989.
DOI : 10.1007/BF02252874

W. Meier and O. Staffelbach, Nonlinearity Criteria for Cryptographic Functions, Lecture Notes in Computer Science, vol.434, pp.549-562, 1990.
DOI : 10.1007/3-540-46885-4_53

M. Mihaljevì-c and J. Golic, A comparison of cryptanalysis principles based on iterative errorcorrection Advances in Cryptology -EUROCYPT'91, Lecture Notes in Computer Science, vol.547, pp.159-176, 1991.

M. Mihaljevì-c and J. Golic, Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register Sequence, Lecture Notes in Computer Science, vol.658, issue.1440, pp.24-137, 1993.
DOI : 10.1007/3-540-47555-9_11

M. J. Mihaljevì-c and J. Golic, A method for convergence analysis of iterative probabilistic decoding, IEEE Transactions on Information Theory, vol.46, issue.6, pp.2206-2211, 2000.
DOI : 10.1109/18.868493

M. J. Mihaljevì-c, M. P. Fossorier, and H. Imai, On decoding techniques for cryptanalysis of certain encryption algorithms, IEICE Transactions on Fundamentals, vol.84, pp.919-930, 2001.

M. J. Mihaljevì-c, M. P. Fossorier, and H. Imai, A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack, Fast Software Encryption Lecture Notes in Computer Science, pp.196-212, 1978.
DOI : 10.1007/3-540-44706-7_14

M. Mihaljevì-c, M. Fossorier, and H. Imai, An Algorithm for Cryptanalysis of Certain Keystream Generators Suitable for High-Speed Software and Hardware Implementations, IEICE Transactions on Fundamentals, pp.311-318, 2001.

M. J. Mihaljevì-c, M. P. Fossorier, and H. Imai, Fast Correlation Attack Algorithm with List Decoding and an Application, Fast Software Encryption Lecture Notes in Computer Science, vol.2355, pp.196-210, 2001.
DOI : 10.1007/3-540-45473-X_17

E. Pasalic, On Boolean Functions in Symmetric-Key Ciphers, 2003.

W. Penzhorn, Correlation attacks on stream ciphers: Computing low-weight parity checks based on error-correcting codes, Lecture Notes in Computer Science, vol.1039, issue.96, 1996.
DOI : 10.1007/3-540-60865-6_51

O. Pothier, Compound codes based on graphs and their iterative decoding, 2000.

T. Richardson and R. Urbanke, The capacity of low-density parity-check codes under message-passing decoding, IEEE Transactions on Information Theory, vol.47, issue.2, pp.599-618, 2001.
DOI : 10.1109/18.910577

T. Richardson, A. Shokrollahi, and R. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.619-637, 2001.
DOI : 10.1109/18.910578

P. Sarkar and S. Maitra, Construction of Nonlinear Boolean Functions with Important Cryptographic Properties, Lecture Notes in Computer Science, vol.1807, pp.485-506, 2000.
DOI : 10.1007/3-540-45539-6_35

J. Seberry, X. M. Zhang, and Y. Zheng, On Constructions and Nonlinearity of Correlation Immune Functions, Advances in Cryptology ? EuroCrypt'93, pp.181-199, 1994.
DOI : 10.1007/3-540-48285-7_16

J. Seberry, X. M. Zhang, and Y. Zheng, Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics, Lecture Notes in Computer Science, vol.773, pp.49-60, 1994.
DOI : 10.1007/3-540-48329-2_5

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.2630

J. Seberry, X. M. Zhang, and Y. Zheng, Relationships among nonlinearity criteria, Lecture Notes in Computer Science, vol.950, pp.376-388, 1995.
DOI : 10.1007/BFb0053452

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.5690

T. Siegenthaler, Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.), IT-30, pp.776-780, 1984.
DOI : 10.1109/TIT.1984.1056949

T. Siegenthaler, Decrypting a Class of Stream Ciphers Using Ciphertext Only, IEEE Transactions on Computers, vol.34, issue.1, pp.81-85, 1985.
DOI : 10.1109/TC.1985.1676518

C. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

J. Stern, A method for finding codewords of small weight Coding Theory and Applications, pp.106-113, 1989.

M. Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound, Journal of Complexity, vol.13, issue.1, pp.180-193, 1997.
DOI : 10.1006/jcom.1997.0439

R. M. Tanner, A recursive approach to low complexity codes, IT-27, pp.533-547, 1981.
DOI : 10.1109/TIT.1981.1056404

Y. Tarannikov, P. Korolev, and A. Botev, Autocorrelation Coefficients and Correlation Immunity of Boolean Functions, pp.460-479, 2001.
DOI : 10.1007/3-540-45682-1_27

Y. Tarannikov, New Constructions of Resilient Boolean Functions with Maximal Nonlinearity, Lecture Notes in Computer Science, pp.66-77, 2001.
DOI : 10.1007/3-540-45473-X_6

A. Vardy, Trellis structure of codes, Handbook of Coding Theory, 1998.

N. Wiberg, Codes and decoding on general graphs, 1996.
DOI : 10.1002/ett.4460060507

N. Wiberg, H. Loeliger, and R. Kötter, Codes and iterative decoding on general graphs, European Transactions on Telecommunications, vol.40, issue.206, pp.513-525, 1995.
DOI : 10.1002/ett.4460060507

G. Xiao and J. Massey, A spectral characterization of correlation-immune combining functions, IEEE Transactions on Information Theory, vol.34, issue.3, pp.569-571, 1988.
DOI : 10.1109/18.6037

G. Zémor, Cours de cryptographie, Cassini 01, 2001.

Y. Zheng and X. Zhang, Plateaued Functions, 2nd International Conference on Information and Communications Security, ICISC'99, pp.284-300, 1999.
DOI : 10.1007/978-3-540-47942-0_24

Y. Zheng and X. M. Zhang, Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions, Lecture Notes in Computer Science, vol.2012, pp.262-274, 2001.
DOI : 10.1007/3-540-44983-3_19