Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
The Use Of Non-Commutative Algebra In Cryptographically Secure Pseudo-Random Number Generators, Brian M. Mckeever
The Use Of Non-Commutative Algebra In Cryptographically Secure Pseudo-Random Number Generators, Brian M. Mckeever
Honors Theses
This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis provides a description of the performance of these generators.
Tests Of Random Number Generators Using Ising Model Simulations, Paul D. Coddington
Tests Of Random Number Generators Using Ising Model Simulations, Paul D. Coddington
Northeast Parallel Architecture Center
Large-scale Monte Carlo simulations require high-quality random number generators to ensure correct results. The contrapositive of this statement is also true – the quality of random number generators can be tested by using them in large-scale Monte Carlo simulations. We have tested many commonly used random number generators with high precision Monte Carlo simulations of the 2-d Ising model using the Metropolis, Swendsen-Wang, and Wolff algorithms. This work is being extended to the testing of random number generators for parallel computers. The results of these tests are presented, along with recommendations for random number generators for high-performance computers, particularly for …