A sequence is any ordered succession of numbers. Depending on the application, the required properties of the sequence vary. In cryptography, the sequences must be computationally indistinguishable from true random ones, while communications need orthogonally between the sequences. The aim of this talk is to give an overview of both approaches.
Pseudorandom Random Number Generators (PRNGs) that are initialized by a random seed, then a known algorithm produces a sequence with good statistical properties. The applications of these generators are many, just as a standalone application but also combined with physical processes to guarantee “randomness” in Hybrid random number generators (HRNGs). The presence of linear structures make it possible to generate sequences in a more efficient way, but also these results in a security vector attack because these relations can be computed quite efficiently.
Generation and simulation of families of sequences with good auto and cross correlation is required in wireless communications and other applications. Many constructions have been proposed that employ m-sequences as basic building blocks, such as the Gordon- Mills-Welch (GMW). The method of composition and substitution is useful to understand and construct generalized sequence generators.
Date: June, 18th, at 11:00h. Location: Maths seminar.