Abstract
A fast and efficient procedure for finding low order approx- imations to large boolean functions, if such approximations exist, is de- veloped. The procedure uses iterative error-correction algorithms for fast correlation attacks on certain stream ciphers and is based on represent- ing low order boolean functions by appropriate linear recurring sequences generated by binary filter generators. Applications and significance of the proposed method in the analysis and design of block and stream ciphers are also discussed.
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
V. Chepyzhov and B. Smeets, “On a fast correlation attack on stream ciphers,” Advances in Cryptology — EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, D. W. Davies ed., Springer-Verlag, pp. 176–185, 1991.
C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science, vol. 561, Springer-Verlag, 1991.
G. C. Clark, Jr. and J. B. Cain, Error-Correcting Coding for Digital Communications. New York: Plenum Press, 1982.
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.
R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 21–28, Jan. 1962.
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ć, “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ć, M. Salmasizadeh, A. Clark, A. Khodkar, and E. Dawson, “Discrete optimisation and fast correlation attacks,” Cryptographic Policy and Algorithms — Brisbane’ 95, Lecture Notes in Computer Science, vol. 1029, E. Dawson and J. Golić eds., Springer-Verlag, pp. 186–200, 1996.
T. Kasami, S. Lin, and W. W. Peterson, “New generalizations of the Reed-Muller codes, part I: primitive codes,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 189–199, Mar. 1968.
E. L. Key, “An analysis of the structure and complexity of nonlinear binary sequence generators,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 732–736, Nov. 1976.
J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
J. L. Massey, “Shift-register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
M. Matsui, “Linear cryptanalysis method for DES cipher,” Advances in Cryptology — EUROCRYPT’ 93, Lecture Notes in Computer Science, vol. 765, T. Helleseth ed., Springer-Verlag, pp. 386–397, 1994.
U. M. Maurer, “New approaches to the design of self-synchronizing stream ciphers,” Advances in Cryptology — EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, D. W. Davies ed., Springer-Verlag, pp. 458–471, 1991.
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.
M. J. Mihaljević and J. Dj. Golić, “A comparison of cryptanalytic principles based on iterative error-correction,” Advances in Cryptology — EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, D. W. Davies ed., Springer-Verlag, pp. 527–531, 1991.
M. J. Mihaljević and J. Dj. Golić, “Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence,” Advances in Cryptology — EUROCRYPT’ 92, Lecture Notes in Computer Science, vol. 658, R. A. Rueppel ed., Springer-Verlag, pp. 124–137, 1993.
W. Millan, “Low order approximation of cipher functions,” Cryptographic Policy and Algorithms — Brisbane’ 95, Lecture Notes in Computer Science, vol. 1029, E. Dawson and J. Golić eds., Springer-Verlag, pp. 144–155, 1996.
R. A. Rueppel, Analysis and Design of Stream Ciphers. Berlin: Springer-Verlag, 1986.
T. Siegenthaler, “Correlation immunity of nonlinear combining functions for cryptographic applications,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 776–780, Sept. 1984.
T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only,” IEEE Trans. Comput., vol. C-34, pp. 81–85, Jan. 1985.
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.
F. J. Williams and N. J. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1988.
G. Z. Xiao and J. L. Massey, “A spectral characterization of correlation-immune combining functions,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 569–571, May 1988.
K. Zeng and M. Huang, “On the linear syndrome method in cryptanalysis,” Advances in Cryptology — CRYPTO’ 88, Lecture Notes in Computer Science, vol. 403, S. Goldwasser ed., Springer-Verlag, pp. 469–478, 1990.
M. V. Živković, “On two probabilistic decoding algorithms for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-37, pp. 1707–1716, Nov. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golić, J.D. (1996). Fast Low Order Approximation of Cryptographic Functions. In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive