Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR

DOI10.1016/J.FFA.2019.101574zbMATH Open1427.94075OpenAlexW2969020780MaRDI QIDQ2007704FDOQ2007704

Tian Tian, Lin-Lin Zhou, Wenfeng Qi, Zhong-Xiao Wang

Publication date: 22 November 2019

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2019.101574

Recommendations

• An interleaved method for constructing de Bruijn sequences
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Construction of de Bruijn sequences from product of two irreducible polynomials
• Constructing de Bruijn sequences based on a new necessary condition
• Cryptographically Strong de Bruijn Sequences with Large Periods

zbMATH Keywords

de Bruijn sequencesconjugate statesnonlinear feedback shift registers

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Title not available (Why is that?)
• Linear Complexity and Random Sequences
• Title not available (Why is that?)
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Algorithms for the generation of full-length shift- register sequences
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• New stream cipher designs. The eSTREAM finalists
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
• On the cycle structure of some nonlinear shift register sequences
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Construction for de Bruijn sequences with large stage
• The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials
• De Bruijn sequences, irreducible codes and cyclotomy
• Generation of some de Bruijn sequences
• Stretching de Bruijn sequences

Cited In (1)

• On the \(k\)-error linear complexities of De Bruijn sequences

Uses Software

• Grain

This page was built for publication: Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007704)