Displaying 21 – 40 of 84

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...

Incomplete character sums and a special class of permutations

S. D. Cohen, H. Niederreiter, I. E. Shparlinski, M. Zieve (2001)

Journal de théorie des nombres de Bordeaux

We present a method of bounding incomplete character sums for finite abelian groups with arguments produced by a first-order recursion. This method is particularly effective if the recursion involves a special type of permutation called an -orthomorphism. Examples of -orthomorphisms are given.

Currently displaying 21 – 40 of 84