1. 分析n-位LFSR生成m=2n-1位长伪随即序列的算法过程。

2. 用程序设计语言将算法过程编程实现。

输入明文：I do like this book

加密算法E：yi=xi^ki

密钥：32-LFSR的输出，初始值：good

本原多项式：x32+x7+x5+x3+x2+x+1

-1. Analysis of n-bit LFSR to generate m = 2n-1 bit length of the sequence was pseudo-algorithm process. 2. With programming languages will be the process of programming algorithms. Enter explicitly: I do like this book encryption algorithm E: yi = xi ^ ki key output :32-LFSR, initial value: good primitive polynomial: x32+ x7+ x5+ x3+ x2+ x+1