Abstract
A finite state machine driven by n independent sources each generating a q-ary sequence is investigated. The q-ary output sequence of that device is considered as the running-key sequence in a stream cipher. Possible definitions for Correlation-Immunity are discussed and a simple condition is given which ensures that divide-and-conquer attacks on such generators are prevented.
Chapter PDF
References
R.E. Miller, “Switching Theory”, Vol. II, Sequential Circuits and Machines, John Wiley & Sons, New York, London, Sydney, 1965.
T. Siegenthaler, “Correlation-Immune Combining Functions for Cryptographic Applications”, IEEE Tr. on Info. Theory, IT-30, No. 5, Sept. 1984.
R. Rueppel, “New Approaches to Stream Ciphers”, Thesis, Swiss Federal Institute of Technology, No. 7714, 1984.
—, “How to Frustrate the Correlation Attack with one Bit of Memory” CRYPTO’85, Santa Barbara, Aug. 18–22, 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
Siegenthaler, T. (1986). Design of Combiners to Prevent Divide and Conquer Attacks. 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_21
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_21
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