Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. T. Herlestam, “On the Complexity of Functions of Linear Shift Register Sequences”, IEEE 1982, Les ARcs, France.
2. E.J. Groth, “Generation of Binary Sequences with Controllable Complexity”, IEEE Trans. on Inf. Th. It-17 1971.
3. T. Siegenthaler, “Correlation Immunity of Nonlinear Combining Functions for Cryptographic Applications.” IEEE Trans. on Inf. Th. It-30 1984.
4. E.S. Selmer, “Linear Recurrence Relations over Finite Fields”, Dept of Math., Univ. of Bergen, Norway, 1966.
5. N. Zierler and W.H. Mills, “Products of Linear Recurring Sequences”, J. Algebra, 27, 1973.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Combinatorial Structures Behind Binary Generalized NTU Sequences;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-03-01
2. References;Applied Cryptography, Second Edition;2015-10-09
3. Combination Generator;Encyclopedia of Cryptography and Security;2011
4. Cross-correlations between quadratic form sequences and geometric sequences over finite fields;Applied Mathematics-A Journal of Chinese Universities;2006-06
5. Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations;Advances in Cryptology — CRYPTO ’96;1996