Cryptographically Strong de Bruijn Sequences with Large Periods

  • Kalikinkar Mandal
  • Guang Gong
Conference paper

DOI: 10.1007/978-3-642-35999-6_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7707)
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

Abstract

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.

Keywords

de Bruijn sequences nonlinear feedback shift registers pseudorandom sequence generators span n sequences compositions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Kalikinkar Mandal
    • 1
  • Guang Gong
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of WaterlooWaterlooCanada

Personalised recommendations