2[3]C E Shannon.A Mathematical Theory of Communication[J].Bell System Technical Journal,1948,27(4):379-423,623-656.
3[4]C E Shannon.Communication theory of secrecy systems[J].Bell System Technical Journal,1949,28(4):656-715.
4[7]Rueppel,R A.Good Stream Cipher Are Hard To Design[A].Proceedings of International Camahan Conference on Security Technology[C].1989.163-174.
5[8]Fuster-Sabater.A family ofkeystream generator with large linear complexity[J].Applied Mathematics Letters,2004,17(6):739-740.
6[9]Z D Dai.ProofofRueppel's Linear Complexity Conjecture[J].IEEE Transactions on Information Theory,1986,It-32(3):440-443.
7[10]H Niederreiter.The Linear Complexity Profile and the Jump Complexity of Keystream Sequences[A].Advances in Cryptology EURO -CRYPT' 90 Proceedings[C].New York:Springer-Verlag,1991.174-188.
8[11]S W Golomb.Shift Register Sequences[M].San Francisco:Holden-Day,1967.
9[12]H Beker,F Piper.Cipher Systems:The Protection of Communications[M].London:Northwood Books,1982.
10[13]R A Rueppel.Analysis and Design of Stream Ciphers[M].New York :Springer-Verlag,1986.
