Information Technology Reference
In-Depth Information
8. Meidl, W.: Discrete Fourier transform, joint linear comoplexity and generalized
joint linear complexity of multisequences. In: Helleseth, T., Sarwate, D., Song, H.-
Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 101-112. Springer, Heidelberg
(2005)
9. Meidl, W., Niederreiter, H.: Linear complexity, k -error linear complexity, and the
discrete Fourier transform. J. Complexity 18, 87-103 (2002)
10. Meidl, W., Niederreiter, H.: On the expected value of the linear complexity and the
k
-error linear complexity of periodic sequences. IEEE Trans. Inform. Theory 48,
2817-2825 (2002)
11. Meidl, W., Niederreiter, H.: The expected value of the joint linear complexity of
periodic multisequences. J. Complexity 19, 61-72 (2003)
12. Niederreiter, H.: Sequences with almost perfect linear complexity profile. In:
Chaum, D., Price, W.L. (eds.) Advances in Cryptology-EUROCRYPT 1987.
LNCS, vol. 304, pp. 37-51. Springer, Berlin (1988)
13. Niederreiter, H., Johansson, T., Maitra, S. (eds.): INDOCRYPT 2003. LNCS,
vol. 2904, pp. 1-17. Springer, Berlin (2003)
14. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Berlin (1986)
15. Rueppel, R.A.: Stream ciphers. In: Simmons, G.J. (ed.) Contemporary Cryptology:
The Science of Information Integrity, pp. 65-134. IEEE Press, New York (1992)
 
Search WWH ::




Custom Search