Abstract
We consider binary sequences obtained by choosing the the most significant bit of each element in a sequence obtained from a feedback shift register of length n operating over the ring Z/2e, that is with arithmetic carried out modulo 2e. The feedback has been made non-linear by using the bit-by-bit exclusive-or function as well as the linear operation of addition. This should increase the cryptologic strength without greatly increasing the computing overheads. The periods and linear equivalences are discussed. Provided certain conditions are met it is easy to check that the period achieves its maximal value.
On leave from the Graduate School, Academia Sinica: Beijing, People’s Republic of China; supported by SERC grant GR/F72727
Chapter PDF
Similar content being viewed by others
References
A M Frieze, J Hastad, R Kannan, J C Lagarias, A Shamir, “Reconstructing truncated integer variables satisfying linear congruences”, SIAM J. Comput., 17, 262–280 (1988)
M Ward, “The arithmetical theory of linear recurring series”, Transactions of the American Mathematical Society, 35, 600–628 (July 1933)
Z D Dai, “Binary Sequences Derived from Maximal Length Linear Sequences over Integral Residue Rings”, Proceedings of the Workshop on Stream Ciphers, eds. T Beth, D Gollmann, F Piper, P Wild, Report 89/1, Europäisches Institut für System-sicherheit, Universität Karlsruhe, D-7500 Karlsruhe 1.
Z D Dai, M Q Huang, “A Criterion for Primitiveness of Polynomials over Z/(2d)”, Kexue Tongbao, to be published
Z D Dai, “Binary Sequences Derived from Sequences over the Integral Residue Rings: (I) Periods and Minimal Polynomials”, to be submitted
Z D Dai, T Beth, D Gollmann, “Lower Bounds for the Linear Complexity of Binary Sequences derived from Sequences over Residue Rings”, Proceedings of Eurocrypt-90
W G Chambers, Z D Dai, “A simple but effective modification to a multiplicative congruential random-number generator”, to be published in IEE Proc E
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chambers, W.G., Dai, Z.D. (1991). On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_18
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive