Evolutionary construction of de bruijn sequences

Authors:
Meltem Sonmez Turan
Affiliations:
National Institute of Standards and Technology, Gaithersburg, MD, USA
Venue:
Proceedings of the 4th ACM workshop on Security and artificial intelligence
Year:
2011

Citing 7
Cited 0

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
How to solve it: modern heuristics

How to solve it: modern heuristics
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Shift Register Sequences

Shift Register Sequences
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
A Comparison Of Memetic Recombination Operators For The Traveling Salesman Problem

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A binary de Bruijn sequence of order n is a cyclic sequence of period 2n, in which each n-bit pattern appears exactly once. These sequences are commonly used in random number generation and symmetric key cryptography particularly in stream cipher design, mainly due to their good statistical properties. Constructing de Bruijn sequences is of interest and well studied in the literature. In this study, we propose a new randomized construction method based on genetic algorithms. The method models de Bruijn sequences as a special type of traveling salesman tours and tries to find optimal solutions to this special type of the traveling salesman problem (TSP). We present some experimental results for n d 14.