IJCNS  Vol.4 No.5 , May 2011
Permutation and Complementary Algorithm to Generate Random Sequences for Binary Logic
Abstract: Randomness number generation plays a key role in network, information security and IT applications. In this paper, a permutation and complementary algorithm is proposed to use vector complementary and permuta-tion operations to extend n-variable Logic function space from 22n functions to 22n * 2n! configurations for variant logic framework. Each configuration contains 2n functions can be shown in a 22n-1*22n-1 matrix. A set of visual results can be represented by their symmetric properties in W, F and C codes respec-tively to provide the essential support on the variant logic framework.
Cite this paper: nullJ. Wan and J. Zheng, "Permutation and Complementary Algorithm to Generate Random Sequences for Binary Logic," International Journal of Communications, Network and System Sciences, Vol. 4 No. 5, 2011, pp. 345-350. doi: 10.4236/ijcns.2011.45039.

[1]   W. Stallings, “Cryptography and Network Security: Principles and Practice,” Prentice Hall, 2005.

[2]   J. Soto and L. Bassham, “Randomness Testing of the Advanced Encryption Standard Finalist Candidates,” National Institute of Standards and Technology (NIST), 2000.

[3]   National Institute of Standards and Technology (NIST), “Random number generation,” 2008. Internet Avail- able:

[4]   J. Zhi, J. Zheng and C. H. Zheng, “A framework to express variant and invariant functional spaces for binary logic,” Frontiers of Electrical and Electronic Engineering in China, Vol. 5, No. 2, 2010, pp. 163-172.

[5]   S. Wolfram, “Theory and Applications of Cellular Auto- mata,” Singapore: Word Scientific, 1986.

[6]   S. Wolfram, “Cellular automata as models of complexity,” Nature, Vol. 311, 1984, pp. 419-424.

[7]   J. Wan and J. Zheng, “Showing Exhaustive Number Sequences of Two Logic Variables for Variant Logic Functional Space,” Proceedings of Asia-Pacific Youth Conference on Communication (APYCC), October 2010, p. 4.