Constructing de Bruijn Sequences Based on a New Necessary Condition

DOI10.1142/S0129054120500094zbMath1461.94070OpenAlexW3022153499MaRDI QIDQ4983540

Tian Tian, Xiangyu Wang, Zhong-Xiao Wang

Publication date: 20 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120500094

zbMATH Keywords

de Bruijn sequencesstream ciphernecessary condition

Mathematics Subject Classification ID

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

Uses Software

• MICKEY
• Grain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorics of N. G. de Bruijn
• New stream cipher designs. The eSTREAM finalists
• Fast correlation attacks on certain stream ciphers
• On the nonlinearity of maximum-length NFSR feedbacks
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• A Class of de Bruijn Sequences
• Algorithms for the generation of full-length shift- register sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A method for constructing decodable de Bruijn sequences
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Constructing de Bruijn Sequences Based on a New Necessary Condition