{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:12:30Z","timestamp":1743826350727,"version":"3.40.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T00:00:00Z","timestamp":1342569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s12095-012-0062-x","type":"journal-article","created":{"date-parts":[[2012,7,17]],"date-time":"2012-07-17T13:43:43Z","timestamp":1342532623000},"page":"173-202","source":"Crossref","is-referenced-by-count":10,"title":["A survey on fast correlation attacks"],"prefix":"10.1007","volume":"4","author":[{"given":"Martin","family":"\u00c5gren","sequence":"first","affiliation":[]},{"given":"Carl","family":"L\u00f6ndahl","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Hell","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Johansson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,18]]},"reference":[{"issue":"2","key":"62_CR1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"20","author":"L Bahl","year":"1974","unstructured":"Bahl, L., Cocke, J., Jelinek, F., Raviv, J.: Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inf. Theory 20(2), 284\u2013287 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"62_CR2","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/26.539767","volume":"4","author":"C Berrou","year":"1996","unstructured":"Berrou, C., Glavieux, A.: Near optimum error correcting and decoding: turbo-codes. IEEE Trans. Commun. 4(10), 1261\u20131271 (1996)","journal-title":"IEEE Trans. Commun."},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding. In: Proc., IEEE Int. Conf. on Communications, ICC\u201993, pp.\u00a01064\u20131070 (1993)","DOI":"10.1109\/ICC.1993.397441"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Yao, F.F., Luks, E.M. (eds.) STOC, pp.\u00a0435\u2013440. ACM (2000)","DOI":"10.1145\/335305.335355"},{"issue":"4","key":"62_CR5","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4), 506\u2013519 (2003)","journal-title":"J. ACM"},{"key":"62_CR6","unstructured":"Canteaut, A., Filiol, E. (2002) On the influence of the filtering function on the performance of fast correlation attacks on filter generators. In: Symposium on Information Theory, pp. 299\u2013306"},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Trabbia, M.: Improved fast correlation attacks using parity-check equations of weight 4 and 5. In: Preneel, B. (ed.) Advances in Cryptology\u2014EUROCRYPT 2000. Lecture Notes in Computer Science, vol. 1807, pp.\u00a0573\u2013588. Springer-Verlag (2000)","DOI":"10.1007\/3-540-45539-6_40"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Chepyzhov, V., Johansson, T., Smeets, B.: A simple algorithm for fast correlation attacks on stream ciphers. In: Schneier, B. (ed.) Fast Software Encryption 2000. Lecture Notes in Computer Science, vol. 1978, pp. 181\u2013195. Springer-Verlag (2000)","DOI":"10.1007\/3-540-44706-7_13"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Chepyzhov, V., Smeets, B.: On a fast correlation attack on certain stream ciphers. In: Davies, D.W. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201991. Lecture Notes in Computer Science, vol. 547, pp. 176\u2013185. Springer-Verlag (1991)","DOI":"10.1007\/3-540-46416-6_16"},{"key":"62_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-46035-7_14","volume":"2332","author":"P Chose","year":"2002","unstructured":"Chose, P., Joux, A., Mitton, M.: Fast correlation attacks: An algorithmic point of view. Lect. Notes Comput. Sci. 2332, 209\u2013221 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"4","key":"62_CR11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D Coppersmith","year":"1984","unstructured":"Coppersmith, D.: Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inf. Theory 30(4), 587\u2013594 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"62_CR12","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"MPC Fossorier","year":"1999","unstructured":"Fossorier, M.P.C., Mihaljevic, M.J., Imai, H.: Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Trans. Commun. 47, 673\u2013680 (1999)","journal-title":"IEEE Trans. Commun."},{"issue":"12","key":"62_CR13","doi-asserted-by":"crossref","first-page":"4728","DOI":"10.1109\/TIT.2007.909164","volume":"53","author":"MPC Fossorier","year":"2007","unstructured":"Fossorier, M.P.C., Mihaljevi\u0107, M.J., Imai, H.: Modeling block decoding approaches for the fast correlation attack. IEEE Trans. Inf. Theory 53(12), 4728\u20134737 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"62_CR14","doi-asserted-by":"crossref","unstructured":"Fossorier, M.P.C., Mihaljevi\u0107, M.J. Imai, H., Cui, Y., Matsuura, K.: An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID authentication. In: Barua, R., Lange, T. (eds.) Progress in Cryptology\u2014INDOCRYPT 2005. Lecture Notes in Computer Science, vol. 4329, pp. 48\u201362. Springer-Verlag (2006)","DOI":"10.1007\/11941378_5"},{"issue":"1","key":"62_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"RG Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IEEE Trans. Inf. Theory 8(1), 21\u201328 (1962)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"62_CR16","doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. PhD thesis, MIT Press, Cambridge (1963)","DOI":"10.7551\/mitpress\/4347.001.0001"},{"issue":"3","key":"62_CR17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"EN Gilbert","year":"1974","unstructured":"Gilbert, E.N., MacWilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell Syst. Tech. J. 53(3), 405\u2013424 (1974)","journal-title":"Bell Syst. Tech. J."},{"key":"62_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: the highly noisy case. In: 36th Annual Symposium on Foundation of Computer Science, pp. 294\u2013303 (1995)","DOI":"10.1109\/SFCS.1995.492485"},{"issue":"21","key":"62_CR19","doi-asserted-by":"crossref","first-page":"1981","DOI":"10.1049\/el:19961338","volume":"32","author":"JDj Goli\u0107","year":"1996","unstructured":"Goli\u0107, J.Dj.: Computation of low-weight parity-check polynomials. Electron. Lett. 32(21), 1981\u20131982 (1996)","journal-title":"Electron. Lett."},{"issue":"7","key":"62_CR20","doi-asserted-by":"crossref","first-page":"3040","DOI":"10.1109\/18.959285","volume":"47","author":"JDj Goli\u0107","year":"2001","unstructured":"Goli\u0107, J.Dj.: Iterative optimum symbol-by-symbol decoding and fast correlation attacks. IEEE Trans. Inf. Theory 47(7), 3040\u20133049 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"62_CR21","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TIT.1976.1055617","volume":"22","author":"CRP Hartmann","year":"1976","unstructured":"Hartmann, C.R.P., Rudolph, L.D.: An optimum symbol-by-symbol decoding rule for linear codes. IEEE Trans. Inf. Theory 22(5):514\u2013517 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"62_CR22","doi-asserted-by":"crossref","unstructured":"Johansson, T., J\u00f6nsson, F.: Fast correlation attacks based on turbo code techniques. In: Wiener, M.J. (ed.) Advances in Cryptology\u2014CRYPTO\u201999. Lecture Notes in Computer Science, vol. 1666, pp. 181\u2013197. Springer-Verlag (1999)","DOI":"10.1007\/3-540-48405-1_12"},{"key":"62_CR23","doi-asserted-by":"crossref","unstructured":"Johansson, T., J\u00f6nsson, F.: Improved fast correlation attacks on stream ciphers via convolutional codes. In: Stern, J. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201999. Lecture Notes in Computer Science, vol. 1592, pp. 347\u2013362. Springer-Verlag (1999)","DOI":"10.1007\/3-540-48910-X_24"},{"key":"62_CR24","doi-asserted-by":"crossref","unstructured":"Johansson, T., J\u00f6nsson, F.: Fast correlation attacks through reconstruction of linear polynomials. In: Bellare, M. (ed.) Advances in Cryptology\u2014CRYPTO 2000. Lecture Notes in Computer Science, vol. 1880, pp.\u00a0300\u2013315. Springer-Verlag (2000)","DOI":"10.1007\/3-540-44598-6_19"},{"key":"62_CR25","unstructured":"J\u00f6nsson, F.: Some results on fast correlation attacks. PhD thesis, Lund University, Department of Information Technology, P.O. Box 118, SE\u2013221 00, Lund, Sweden (2002)"},{"key":"62_CR26","doi-asserted-by":"crossref","unstructured":"Levieil, \u00c9., Fouque, P.-A.: An improved LPN algorithm. In: De Prisco, R., Yung, M. (eds.) SCN. Lecture Notes in Computer Science, vol. 4116, pp. 348\u2013359. Springer-Verlag (2006)","DOI":"10.1007\/11832072_24"},{"key":"62_CR27","doi-asserted-by":"crossref","unstructured":"Meier, W.: Fast correlation attacks: methods and countermeasures. In: Joux, A. (eds.) Fast Software Encryption 2011. Lecture Notes in Computer Science, pp. 55\u201367. Springer-Verlag (2011)","DOI":"10.1007\/978-3-642-21702-9_4"},{"issue":"3","key":"62_CR28","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF02252874","volume":"1","author":"W Meier","year":"1989","unstructured":"Meier, W., Staffelbach, O.: Fast correlation attacks on certain stream ciphers. J. Cryptol. 1(3), 159\u2013176 (1989)","journal-title":"J. Cryptol."},{"key":"62_CR29","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107, M.J., Fossorier, M., Imai, H.: A low-complexity and high-performance algorithm for the fast correlation attack. In: Schneier, B. (ed.) Fast Software Encryption 2000. Lecture Notes in Computer Science, vol. 1978, pp. 196\u2013212. Springer-Verlag (2000)","DOI":"10.1007\/3-540-44706-7_14"},{"key":"62_CR30","first-page":"919","volume":"E84-A","author":"MJ Mihaljevi\u0107","year":"2001","unstructured":"Mihaljevi\u0107, M.J., Fossorier, M., Imai, H.: On decoding techniques for cryptanalysis of certain encryption algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E84-A, 919\u2013930 (2001)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"62_CR31","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107, M.J., Fossorier, M., Imai, H.: Fast correlation attack algorithm with list decoding and an application. In: Fast Software Encryption 2001. Lecture Notes in Computer Science, vol. 2355, pp. 196\u2013210. Springer-Verlag (2002)","DOI":"10.1007\/3-540-45473-X_17"},{"key":"62_CR32","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107, M.J., Goli\u0107, J.D.: A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence. In: Seberry, J., Pieprzyk, J. (eds.) Advances in Cryptology\u2014AUSCRYPT\u201990. Lecture Notes in Computer Science, vol. 453, pp. 165\u2013175. Springer-Verlag (1990)","DOI":"10.1007\/BFb0030359"},{"key":"62_CR33","doi-asserted-by":"crossref","unstructured":"Molland, H., Mathiassen, J., Helleseth, T.: Improved fast correlation attack using low rate codes. In: Paterson, K. (ed.) Cryptography and Coding\u20149th IMA Conference. Lecture Notes in Computer Science, vol. 2898, pp. 67\u201381. Springer Berlin\/Heidelberg (2003)","DOI":"10.1007\/978-3-540-40974-8_7"},{"key":"62_CR34","doi-asserted-by":"crossref","unstructured":"Noorkami, M., Fekri, F.: A fast correlation attack via unequal error correcting ldpc codes. In: Okamoto, T. (ed.) Topics in Cryptology\u2014CT-RSA 2004. Lecture Notes in Computer Science, vol. 2964, pp. 54\u201366 (2004)","DOI":"10.1007\/978-3-540-24660-2_5"},{"key":"62_CR35","doi-asserted-by":"crossref","unstructured":"Penzhorn, W.T.: Correlation attacks on stream ciphers: computing low weight parity checks based on error correction codes. In: Gollman, D. (ed.) Fast Software Encryption\u201996. Lecture Notes in Computer Science, vol. 1039, pp. 159\u2013172. Springer-Verlag (1996)","DOI":"10.1007\/3-540-60865-6_51"},{"key":"62_CR36","doi-asserted-by":"crossref","unstructured":"Penzhorn, W.T., K\u00fchn, G.J.: Computation of low-weight parity checks for correlation attacks on stream ciphers. In: Boyd, C. (ed.) Cryptography and Coding\u20145th IMA Conference. Lecture Notes in Computer Science, vol. 1025, pp. 74\u201383. Springer-Verlag (1995)","DOI":"10.1007\/3-540-60693-9_10"},{"key":"62_CR37","unstructured":"Siegenthaler, T.: Correlation Attacks on Certain Stream Ciphers with Nonlinear Generators. Presented at IEEE Int. Symp. Inform. Theory, Saint Jovite, Canada, 26\u201329 Sept. (1983)"},{"key":"62_CR38","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TC.1985.1676518","volume":"34","author":"T Siegenthaler","year":"1985","unstructured":"Siegenthaler, T.: Decrypting a class of stream ciphers using ciphertext only. IEEE Trans. Comput. 34, 81\u201385 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"62_CR39","doi-asserted-by":"crossref","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) Advances in Cryptology\u2014CRYPTO 2002. Lecture Notes in Computer Science, vol. 2442, pp. 288\u2013303. Springer-Verlag (2002)","DOI":"10.1007\/3-540-45708-9_19"},{"key":"62_CR40","doi-asserted-by":"crossref","unstructured":"Zhang, B., Feng, D.: Multi-pass fast correlation attack on stream ciphers. In: Biham, E., Youssef, A.M. (eds.) Selected Areas in Cryptography\u2014SAC 2006. Lecture Notes in Computer Science, vol. 4356, pp. 234\u2013248. Springer-Verlag (2007)","DOI":"10.1007\/978-3-540-74462-7_17"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-012-0062-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-012-0062-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-012-0062-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T12:34:02Z","timestamp":1743770042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-012-0062-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,18]]},"references-count":40,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s12095-012-0062-x","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2012,7,18]]}}}