The three states functions : Foundations and complexity

Author

Sabour, Abderrahim ; Lbekkouri, Aboubakr ; Sabour, Mounir

Author_Institution

Dept. of Math. & Comput. Sci., Univ. Mohammed V, Rabat

fYear

2008

Firstpage

850

Lastpage

856

Abstract

In this article, we propose a study of the characteristics of the R.A NMJ algorithm which Is a new regenerator of pseudo-random sequences. The functions and classes of three states functions are fully used by the algorithm R.A NMJ to such a point that the theoretical analysis of the latter is connected to the one of the functions and the classes of functions. This analysis will study the linearity and injectivity of these three states functions as well as estimation on a collective complexity of the classes of the three states functions with the help of the MDS algorithm.

Keywords

computational complexity; random number generation; R.A NMJ algorithm; collective complexity; pseudorandom sequences generator; three states functions; Algorithm design and analysis; Binary sequences; Computer science; Linearity; Logic; Marketing and sales; Mathematics; Multidimensional systems; State estimation; Strontium; algorithm R.A NMJ; component; evolutionist algorithms; multidimensional scaling; three states functions;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Control and Signal Processing, 2008. ISCCSP 2008. 3rd International Symposium on

Conference_Location

St Julians

Print_ISBN

978-1-4244-1687-5

Electronic_ISBN

978-1-4244-1688-2

Type

conf

DOI

10.1109/ISCCSP.2008.4537342

Filename

4537342