Pseudorandom Number Generation Using Cellular Automata

Abstract-Realization of Randomness had always been a controversial concept with great importance both from theoretical and practical Perspectives. This realization has been revolutionized in the light of recent studies especially in the realms of Chaos Theory, Algorithmic Information Theory and Emergent behavior in complex systems. We briefly discuss different definitions of Randomness and also different methods for generating it. The connection between all these approaches and the notion of Normality as the necessary condition of being unpredictable would be discussed. Then a complex-system-based Random Number Generator would be introduced. We will analyze its paradoxical features (Conservative Nature and reversibility in spite of having considerable variation) by using information theoretic measures in connection with other measures. The evolution of this Random Generator is equivalent to the evolution of its probabilistic description in terms of probability distribution over blocks of different lengths. By getting the aid of simulations we will show the ability of this system to preserve normality during the process of coarse graining.

show abstract

Omega Network Hash Construction

Wen¹,

Samsudin²

2009

J. of Computer Science

View full text Add to dashboard Cite

Problem statement: Cryptographic hash functions are important cryptographic primitives. They are commonly used for data integrity checking and data authentication. Most of the cryptographic hash functions are based on the Merkle-Damgård construction. The basic MerkleDamgård construction runs over the input sequentially, which can lead to problems when the input size is large since the computation time increases linearly. Approach: Therefore, an alternative architecture which can reduce the computation time is needed, especially in today's world where multi-core processors and multithreaded programming are common. An Omega Network Hash Construction (ONHC) run parallel in multi-core machine has been proposed as an alternative to the existing hash constructions. Result: The ONHC performed better than the Merkle-Damgård construction. ONHC permutation architecture also showed improved security strength in term of digest value randomness when compared to Merkle-Damgård construction. Conclusion: Therefore, it is believed that the proposed ONHC is a valuable structure that can improve the performance of any hash function that can run on top of it.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Pseudorandom Number Generation Using Cellular Automata

Cited by 3 publications

References 7 publications

On the combination of self-organized systems to generate pseudo-random numbers

On the combination of self-organized systems to generate pseudo-random numbers

An Information Theoretic Analysis of Random Number Generator based on Cellular Automaton

Omega Network Hash Construction

Contact Info

Product

Resources

About