Cryptographically Strong de Bruijn Sequences with Large Periods
- Cite this paper as:
- Mandal K., Gong G. (2013) Cryptographically Strong de Bruijn Sequences with Large Periods. In: Knudsen L.R., Wu H. (eds) Selected Areas in Cryptography. SAC 2012. Lecture Notes in Computer Science, vol 7707. Springer, Berlin, Heidelberg
In this paper we first refine Mykkeltveit et al.’s technique for producing de Bruijn sequences through compositions. We then conduct an analysis on an approximation of the feedback functions that generate de Bruijn sequences. The cycle structures of the approximated feedback functions and the linear complexity of a sequence produced by an approximated feedback function are determined. Furthermore, we present a compact representation of an (n + 16)-stage nonlinear feedback shift register (NLFSR) and a few examples of de Bruijn sequences of period 2n, 35 ≤ n ≤ 40, which are generated by the recursively constructed NLFSR together with the evaluation of their implementation.
Keywordsde Bruijn sequences nonlinear feedback shift registers pseudorandom sequence generators span n sequences compositions
Unable to display preview. Download preview PDF.