Abstract
This paper discusses analysis and synthesis of non- linear generators which consist of a single linear feedback shift register (LFSR) with a primitive connection polynomial, a random select generator and a non-linear feedforward logic. It is shown that the linear complexity of the generated keystream can be determined, realization is easy and its security is much better than the original feedforward system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Gong Guang, m-Sequence Runs, component sequences and vector sequences in Galois field, ACTA ELECTRONICA SINICA, Vol. 14, No. 4, July 1986, pp94–100.
Th. Siegenthaler, Methoden fur den entwurf von stream cipher system, Diss. ETH, No. 8185, Dec. 1986.
Th. Siegenthaler and Rejane Forre, Generation of binary sequences with controllable complexity and ideal r-tupel distribution, Advances in Cryptology-EUROCRYPT '87.
Gong Guang, Analysis of the parallel sequences. Was selected for the Proceedings of the 5th Meeting of a Workshop on Applied Mathematics, Oct. 1988, China.
F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guang, G. (1990). Nonlinear generators of binary sequences with controllable complexity and double key. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030348
Download citation
DOI: https://doi.org/10.1007/BFb0030348
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53000-8
Online ISBN: 978-3-540-46297-2
eBook Packages: Springer Book Archive