A Scalable Method for Constructing Galois NLFSRs With Period 2n-1 Using Cross-Join Pairs

被引:33
作者
Dubrova, Elena [1 ]
机构
[1] Royal Inst Technol KTH, Stockholm, Sweden
基金
瑞典研究理事会;
关键词
NLFSR; LFSR; cross-join pairs; de Bruijn sequence; maximum length sequence; pseudo-random sequence;
D O I
10.1109/TIT.2012.2214204
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A method for constructing n-stage Galois NLFSRs with period 2(n) - 1 from n-stage maximum length LFSRs is presented. Nonlinearity is introduced into state cycles by adding a non-linear Boolean function to the feedback polynomial of the LFSR. Each assignment of variables for which this function evaluates to 1 acts as a crossing point for the LFSR state cycle. The effect of non-linearity is cancelled and state cycles are joined back by adding a copy of the same function to a later stage of the register. The presented method requires no extra time steps and it has a smaller area overhead compared to the previous approaches based on cross-join pairs. It is feasible for large n.
引用
收藏
页码:703 / 709
页数:7
相关论文
共 29 条
[1]   Generating De Bruijn sequences: An efficient implementation [J].
Annexstein, FS .
IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (02) :198-200
[2]  
[Anonymous], P ISZTA 90
[3]  
[Anonymous], DISJOINT CYCLES BRUI
[4]  
[Anonymous], TR701 STREAM CIPH
[5]  
[Anonymous], T COMPUTERS
[6]  
Chabloz JM, 2010, LECT NOTES COMPUT SC, V6338, P41, DOI 10.1007/978-3-642-15874-2_3
[7]   An efficient implementation of the D-homomorphism for generation of de Bruijn sequences [J].
Chang, T ;
Park, B ;
Kim, YH ;
Song, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (04) :1280-1283
[8]  
Cusick TW., 2009, Cryptographic Boolean Functions and Applications
[9]  
de Bruijn N.G., 1949, PROC KONINKLIJKE NED, VA49, P758
[10]  
De Cannière C, 2008, LECT NOTES COMPUT SC, V4986, P244