Displaying 321 – 340 of 1160

Showing per page

Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.

P. Caballero Gil, A. Fúster Sabater (1998)

Revista Matemática Complutense

Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...

Explicit construction of normal lattice configurations

Mordechay B. Levin, Meir Smorodinsky (2005)

Colloquium Mathematicae

We extend Champernowne’s construction of normal numbers to base b to the d case and obtain an explicit construction of a generic point of the d shift transformation of the set 0 , 1 , . . . , b - 1 d .

Currently displaying 321 – 340 of 1160