摘要： 针对s-LFSR能够充分利用现代通用CPU且具有结构简单、适合软件快速实现的特点，利用本原s-LFSR的距离向量和基判别定理，将本原s-LFSR的计数问题转化为线性空间上基的问题，以此为基础，利用F2上次数小于n的互素多项式的对数解决F4上本原s-LFSR的计数问题。
关键词:
序列密码,
本原s-LFSR,
基判别定理,
计数
Abstract: s-LFSR is a kind of word-oriented Linear Feedback Shift Register(LFSR) with high efficiency and good cryptographic properties, especially its software implementation is efficient for modern processors. Through the coordinate sequences and base discriminance of primitive s-LFSR, this paper converts the study of counting to the basis of liner space, and through the pairs of relatively prime polynomials on F2 with degree smaller than n, the counting formula of primitive s-LFSR on F4 is obtained.
Key words:
stream cipher,
primitive s-LFSR,
base discriminance,
counting
中图分类号:
刘向辉;张 猛;韩文报;曾 光. 本原s-LFSR的计数研究[J]. 计算机工程, 2009, 35(18): 154-155.
LIU Xiang-hui; ZHANG Meng; HAN Wen-bao; ZENG Guang. Research on Counting of Primitive s-LFSR[J]. Computer Engineering, 2009, 35(18): 154-155.