For stream ciphers, we need to generate pseudorandom sequences which are of properties of unpredictability and randomness. A important measure of unpredictability and randomness is the linear complexity profile (l.c.p.) l/sub a/(n) of a sequence a. A sequence a is called almost perfect if the l.c.p. is l/sub a/(n)=n/2+O(1). Based on curves over finite fields, we present a method to construct almost perfect sequences. We also illustrate our construction by explicit examples from the projective line and elliptic curves over the binary field.
展开▼
机译：对于流密码，我们需要生成具有不可预测性和随机性的伪随机序列。不可预测性和随机性的重要度量是序列a的线性复杂度分布（l.c.p.）l / sub a /（n）。如果l.c.p，则序列a称为几乎完美。是l / sub a /（n）= n / 2 + O（1）。基于有限域上的曲线，我们提出了一种构建几乎完美序列的方法。我们还通过二元域上投影线和椭圆曲线的显式示例来说明我们的构造。
展开▼
