Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference21 articles.
1. Chen, H.: Fast algorithms for determining the linear complexity of sequences over GF(p m ) with period 2 t n. IEEE Trans. Inf. Theory 51, 1854–1856 (2005)
2. Chen, H.: Reducing the computation of linear complexities of periodic sequences over GF(p m ). IEEE Trans. Inf. Theory 52, 5537–5539 (2006)
3. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland, Amsterdam (1998)
4. Dai, Z.D., Yang, J.H.: Linear complexity of periodically repeated random sequences. In: Davies, D.W. (ed.) Advances in Cryptology – EUROCRYPT’91, Lecture Notes in Computer Science, vol. 547, pp. 168–175. Springer, Berlin (1991)
5. Ding, C.: A fast algorithm for the determination of linear complexity of sequences over GF(p m ) with period p n . In: The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science, vol. 561, pp. 141–144. Springer, Berlin (1991)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献