Abstract
It is known that for a memoryless mapping from GF(2)N into GF(2) the nonlinear order of the mapping and its correlation-immunity form a linear tradeoff. In this paper it is shown that the same tradeoff does no longer hold when the function is allowed to have memory. Moreover, it is shown that integer addition, when viewed over GF(2), defines an inherently nonlinear function with memory whose correlation-immunity is maximum. The summation generator which sums N binary sequences over the integers is shown as an application of integer addition in random sequence generation.
References
T. Siegenthaler, “Decrypting a Class of Stream Ciphers Using Ciphertext Only”, IEEE Trans. on Computers, Vol. C-33, 1984.
T. Siegenthaler, “Correlation-Immunity of Nonlinear Combining Functions for Cryptographic Applications”, IEEE Trans. on Info. Th., Vol. IT-31, 1985.
Xiao Guo-zhen, J.L. Massey, “A Spectral Characterization of Correlation-Immune Combining Functions”, submitted to IEEE Trans. on Info. Th.
V.S. Pless, “Encryption Schemes for Computer Confidentiality”, IEEE Trans. on Computers, Vol. C-26, Nov. 1977.
T. Siegenthaler, “Design of Combiners to Prevent Divide and Conquer Attacks”, Proceedings of Crypto 85, Santa Barbara, August 18–22, 1985.
U. Maurer, R. Viscardi, “Running-Key Generators with Memory in the Nonlinear Combining Function”, Diploma Project, Swiss Federal Institute of Technology Zurich, Dec. 1984.
R.A. Rueppel, J.L. Massey, “The Knapsack as a Nonlinear Function”, IEEE Symposium on Info. Th., Brighton, UK, June 24–28, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rueppel, R.A. (1986). Correlation Immunity and the Summation Generator. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive