Cryptology ePrint Archive: Report 2015/1091

Construction for de Bruijn Sequences with Large Orders

Junwu Dong and Dingyi Pei

Abstract: Sequences generated by maximum-period nonlinear feedback shift registers are known as de Bruijn sequences. The problem of designing de Bruijn sequences has received considerable attention. There is only one full cycle in the state graph of de Bruijn sequences. Most popular algorithms for generating de Bruijn sequences start from a nonsingular linear feedback shift register producing several shorter cycles in its state graph, then join them into one cycle. Unfortunately, the order $n$ of the resulting de Bruijn sequence by using this kind of algorithms is small so far (usually $n \le 40$). We introduce a new concept of correlated cycles between the cycles in the state graph of a LFSR. Based on this concept we present a algorithm for constructing de Bruijn sequences with large orders (such as $n=128$). This is the first publication for designing de Bruijn sequences with such large orders.

Category / Keywords: secret-key cryptography / de Bruijn sequence, state cycle, period of irreducible polynomial, conjugate states, $t$-correlated circles

Date: received 9 Nov 2015, withdrawn 27 Apr 2016

Contact author: djunwu at 163 com

Available format(s): (-- withdrawn --)

Version: 20160428:052754 (All versions of this report)

Short URL: ia.cr/2015/1091

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]