摘要
针对σ-LFSR能够充分利用现代通用CPU且具有结构简单、适合软件快速实现的特点,利用本原σ-LFSR的距离向量和基判别定理,将本原σ-LFSR的计数问题转化为线性空间上基的问题,以此为基础,利用F2上次数小于n的互素多项式的对数解决F4上本原σ-LFSR的计数问题。
σ-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 σ-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 σ-LFSR on F4 is obtained.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第18期154-155,158,共3页
Computer Engineering
基金
国家"863"计划基金资助项目(2006AA01Z425)
国家自然科学基金资助项目(90704003)
