Abstract
An improved method for the fast correlation attack on certain stream ciphers is presented. The proposed algorithm employs the following decoding approaches: list decoding in which a candidate is assigned to the list based on the most reliable information sets, and minimum distance decoding based on Hamming distance. Performance and complexity of the proposed algorithm are considered. A desirable characteristic of the proposed algorithm is its theoretical analyzibility, so that its performance can also be estimated in cases where corresponding experiments are not feasible due to the current technological limitations. The algorithm is compared with relevant recently reported algorithms, and its advantages are pointed out. Finally, the proposed algorithm is considered in a security evaluation context of a proposal (NESSIE) for stream ciphers.
Chapter PDF
Keywords
References
A. Biryukov and A. Shamir, “Cryptanalytic Time/ Memory/ Data Tradeoffs for Stream Ciphers”, Advances in Cryptology-ASIACRYPT2000, Lecture Notes in Computer Science, vol. 1976, pp. 1–13, 2000.
A. Canteaut and M. Trabbia, “Improved fast correlation attacks using parity-check equations of weight 4 and 5,” Advances in Cryptology-EUROCRYPT’2000, Lecture Notes in Computer Science, vol. 1807, pp. 573–588, 2000.
V. V. Chepyzhov, T. Johansson and B. Smeets, “A simple algorithm for fast correlation attacks on stream ciphers,” Fast Software Encryption-FSE2000, Lecture Notes in Computer Science, vol. 1978, pp. 180–195, 2001.
P. Elias, “List decoding for noisy channels,rd Wescon Convention Record, Part 2, Institute of Radio Engineers (now IEEE), pp. 94–104, 1957.
P. Elias, “Zero error capacity under list decoding,” IEEE Trans. Inform. Theory, vol 34, pp. 1070–1074, Sept. 1988.
P. Elias, “Error-correcting codes for list decoding,” IEEE Trans. Inform. Theory, vol 37, pp. 5–12, Jan. 1991.
M. P. C. Fossorier, M. J. Mihaljević and H. Imai, “Critical noise for convergence of iterative probabilistic decoding with belief propagation in cryptographic applications,” Applied Algebra, Algebraic Algorithms and Error Correcting Codes-AAECC 13, Lecture Notes in Computer Science, vol. 1719, pp. 282–293, 1999.
T. Johansson and F. Jonsson, “Improved fast correlation attacks on stream ciphers via convolutional codes,” Advances in Cryptology-EUROCRYPT’99, Lecture Notes in Computer Science, vol. 1592, pp. 347–362, 1999.
T. Johansson and F. Jonsson, “Fast correlation attacks based on turbo code techniques,” Advances in Cryptology-CRYPTO’99, Lecture Notes in Computer Science, vol. 1666, pp. 181–197, 1999.
T. Johansson and F. Jonsson, “Fast correlation attacks through reconstruction of linear polynomials,” Advances in Cryptology-CRYPTO2000, Lecture Notes in Computer Science, vol. 1880, pp. 300–315, 2000.
S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice Hall, 1983.
J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
A. Menezes, P.C. van Oorschot and S.A. Vanstone, Handbook of Applied Cryptography. Boca Roton: CRC Press, 1997.
W. Meier and O. Staffelbach, “Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, vol. 1, pp. 159–176, 1989.
M. J. Mihaljević, M. P. C. Fossorier and H. Imai, “A low-complexity and high-performance algorithm for the fast correlation attack,” Fast Software Encryption-FSE2000, Lecture Notes in Computer Science, vol. 1978, pp. 196–212, 2001.
M. J. Mihaljević, M. P. C. Fossorier and H. Imai, “An algorithm for cryptanalysis of certain keystream generators suitable for high-speed software and hardware implementations,” IEICE Trans. Fundamentals, vol. E84-A, pp. 311–318, Jan. 2001.
M. J. Mihaljević, M. P. C. Fossorier and H. Imai, “On decoding techniques for cryptanalysis of certain encryption algorithms,” IEICE Trans. Fundamentals, vol. E84-A, pp. 919–930, Apr. 2001.
M. J. Mihaljević and J. Dj. Golić, “A method for convergence analysis of iterative probabilistic decoding,” IEEE Trans. Inform. Theory, vol. 46, pp. 2206–2211, Sept. 2000.
NESSIE list of Accepted Submissions: Proposal for Synchronous Stream Cipher LILI-128, Nov. 2000, http://www.cosic.esat.kuleuven.ac.be/nessie.
T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only,” IEEE Trans. Comput., vol. C-34, pp. 81–85, 1985.
J. M. Wozencraft,“List decoding,” Quarterly Progress Report, vol. 48, pp. 90–95, Research Laboratory of Electronics,MIT, Jan. 15, 1958.
K. Zeng and M. Huang, “On the linear syndrome method in cryptanalysis,” Advances in Cryptology-CRYPTO’ 88, Lecture Notes in Computer Science, vol. 403, pp. 469–478, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mihaljevi, M.J., Fossorier, M.P.C., Imai, H. (2002). Fast Correlation Attack Algorithm with List Decoding and an Application. In: Matsui, M. (eds) Fast Software Encryption. FSE 2001. Lecture Notes in Computer Science, vol 2355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45473-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-45473-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43869-4
Online ISBN: 978-3-540-45473-1
eBook Packages: Springer Book Archive