Abstract
By regarding a nonlinear filter keystream generator as a finite input memory combiner, it is observed that a recent, important attack introduced by Anderson can be viewed as a conditional correlation attack. Necessary and sufficient conditions for the output sequence to be purely random given than the input sequence is such are pointed out and a new, so-called inversion attack is introduced, which may work for larger input memory sizes in comparison with the Anderson's attack. Large input memory size and use of full positive difference sets and correlation immune nonlinear filter functions are proposed as new design criteria to ensure the security against the considered attacks.
This research was supported in part by the Science Fund of Serbia, Grant #0403, through the Institute of Mathematics, Serbian Academy of Arts and Sciences.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. J. Anderson, ”Searching for the optimum correlation attack,” Fast Software Encryption — Leuven '94, Lecture Notes in Computer Science, vol. 1008, B. Preneel ed., Springer-Verlag, pp. 137–143, 1995.
C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science, vol. 561, Springer-Verlag, 1991.
R. Forré, ”A fast correlation attack on nonlinearly feedforward filtered shift-register sequences,” Advances in Cryptology — EUROCRYPT '89, Lecture Notes in Computer Science, vol. 434, J.-J. Quisquater and J. Vandewalle eds., Springer-Verlag, pp. 586–595, 1990.
J. Dj. Golić, ”Correlation via linear sequential circuit approximation of combiners with memory,” Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, vol. 658, R. A. Rueppel ed., Springer-Verlag, pp. 113–123, 1993.
J. Dj. Golić, ”On the security of shift register based keystream generators,” Fast Software Encryption — Cambridge '93, Lecture Notes of Computer Science, vol. 809, R. J. Anderson ed., Springer-Verlag, pp. 90–100, 1994.
J. Dj. Golić, ”Intrinsic statistical weakness of keystream generators,” Advances in Cryptology — ASIACRYPT '94, Lecture Notes in Computer Science, vol. 917, J. Pieprzyk and R. Safavi-Naini eds., Springer-Verlag, pp. 91–103, 1995.
J. Dj. Golić, ”Linear cryptanalysis of stream ciphers,” Fast Software Encryption — Leuven '94, Lecture Notes in Computer Science, vol. 1008, B. Preneel ed., Springer-Verlag, pp. 154–169, 1995.
J. Dj. Golić, ”Correlation properties of a general binary combiner with memory,” Journal of Cryptology, to appear.
J. Dj. Golić, ”On decimation of linear recurring sequences,” The Fibonacci Quarterly, vol. 33, pp. 407–411, Nov. 1995.
D. Gollmann and W. Chambers, ”Clock-controlled shift registers: a review,” IEEE J. Sel. Ar. Commun., vol. 7(4), pp. 525–533, May 1989.
S. Lin and D. J. Jr. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
R. Lorentzen and R. Nilsen, ”Application of linear programming to the optimal difference triangle set problem,” IEEE Trans. Inform. Theory, vol. IT-37, pp. 1486–1488, Sep. 1991.
J. L. Massey, ”Shift-register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
G. Mayhew, ”A low cost, high speed encryption system and method,” in Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy, IEEE Computer Society Press, pp. 147–154, 1994.
W. Meier and O. Staffelbach, ”Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, vol. 1(3), pp. 159–176, 1989.
W. Meier and O. Staffelbach, ”Nonlinearity criteria for cryptographic functions,” Advances in Cryptology — EUROCRYPT '89, Lecture Notes in Computer Science, vol. 434, J.-J. Quisquater and J. Vandewalle eds., Springer-Verlag, pp. 549–562, 1990.
W. Meier and O. Staffelbach, ”Correlation properties of combiners with memory in stream ciphers,” Journal of Cryptology, vol. 5(1), pp. 67–86, 1992.
R. Menicocci, ”Cryptanalysis of a two-stage Gollmann cascade generator,” in Proceedings of SPRC '93, Rome, Italy, pp. 62–69, 1993.
S.-J. Park, S.-J. Lee, and S.-C. Goh, ”On the security of the Gollmann cascades,” Advances in Cryptology — CRYPTO '95, Lecture Notes in Computer Science, vol. 963, D. Coppersmith ed., Springer-Verlag, pp. 148–157, 1995.
R. A. Rueppel, Analysis and Design of Stream Ciphers. Berlin: Springer-Verlag, 1986.
R. A. Rueppel, ”Stream ciphers,” in Contemporary Cryptology: The Science of Information Integrity, G. Simmons ed., pp. 65–134. New York: IEEE Press, 1991.
T. Siegenthaler, ”Correlation immunity of nonlinear combining functions for cryptographic applications,” IEEE Trans. Inform. Theory., vol. IT-30, pp. 776–780, Sep. 1984.
T. Siegenthaler, ”Cryptanalyst's representation of nonlinearly filtered ML-sequences,” Advances in Cryptology — EUROCRYPT '85, Lecture Notes in Computer Science, vol. 219, F. Pichler ed., Springer-Verlag, pp. 103–110, 1986.
B. Snow, ”Multiple independent binary bit stream generator,” U.S. Patent No. 5, 237,615, 1993.
D. R. Stinson and J. L. Massey, ”An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions,” Journal of Cryptology, vol. 8(3), pp. 167–173, 1995.
C.-K. Wu, ”Boolean functions in cryptology,” Ph.D. thesis, Xidian University, China, 1993.
X.-M. Zhang and Y. Zheng, ”On nonlinear resilient functions,” Advances in Cryptology — EUROCRYPT '95, Lecture Notes in Computer Science, vol. 921, L. C. Guillou ed., Springer-Verlag, pp. 274–288, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golić, J.D. (1996). On the security of nonlinear filter generators. In: Gollmann, D. (eds) Fast Software Encryption. FSE 1996. Lecture Notes in Computer Science, vol 1039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60865-6_52
Download citation
DOI: https://doi.org/10.1007/3-540-60865-6_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60865-3
Online ISBN: 978-3-540-49652-6
eBook Packages: Springer Book Archive