Generalized Joint Linear Complexity of Linear Recurring Multisequences
暂无分享,去创建一个
[1] Tatsuaki Okamoto,et al. Advances in Cryptology — ASIACRYPT 2000 , 2000, Lecture Notes in Computer Science.
[2] Gustavus J. Simmons,et al. Contemporary Cryptology: The Science of Information Integrity , 1994 .
[3] Philip Hawkes,et al. Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers , 2000, ASIACRYPT.
[4] Ming Su,et al. The expectation and variance of the joint linear complexity of random periodic multisequences , 2005, J. Complex..
[5] Fred Piper,et al. Stream Ciphers , 1982, EUROCRYPT.
[6] Harald Niederreiter,et al. Sequences With Almost Perfect Linear Complexity Profile , 1987, EUROCRYPT.
[7] Harald Niederreiter,et al. The expected value of the joint linear complexity of periodic multisequences , 2003, J. Complex..
[8] Tor Helleseth. Sequences and Their Applications - SETA 2004, Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers , 2005, SETA.
[9] Harald Niederreiter. Coding Theory and Cryptology , 2002 .
[10] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.
[11] Harald Niederreiter,et al. Joint linear complexity of multisequences consisting of linear recurring sequences , 2009, Cryptography and Communications.
[12] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[13] Rudolf Lide,et al. Finite fields , 1983 .
[14] Wilfried Meidl,et al. Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform , 2002, J. Complex..
[15] Ed Dawson,et al. Analysis and Design Issues for Synchronous Stream Ciphers , 2002 .
[16] Wilfried Meidl,et al. Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences , 2004, SETA.
[17] Harald Niederreiter,et al. On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences , 2002, IEEE Trans. Inf. Theory.