• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 115,203
Next 10 →

Random Number Generator Recommendation by

by Charles N. Zeeb, Patrick J. Burns, Xn M
"... The generation of uniform pseudo-random numbers between 0 and 1 is important in many numerical simulations. The purpose of this report is to explore the best generator(s) of such random numbers in terms of statistical properties and speed. While attempting to find the best generator in general, the ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The generation of uniform pseudo-random numbers between 0 and 1 is important in many numerical simulations. The purpose of this report is to explore the best generator(s) of such random numbers in terms of statistical properties and speed. While attempting to find the best generator in general

True Random Number Generators

by Çetin Kaya Koç, Ç. K. Koç
"... Abstract Random numbers are needed in many areas: cryptography, Monte Carlo computation and simulation, industrial testing and labeling, hazard games, gam-bling, etc. Our assumption has been that random numbers cannot be computed; because digital computers operate deterministically, they cannot prod ..."
Abstract - Add to MetaCart
produce random numbers. Instead, random numbers are best obtained using physical (true) random number generators (TRNG), which operate by measuring a well-controlled and specially prepared physical process. Randomness of a TRNG can be precisely, scientifically characterized and measured. Especially

ON THE INITIAL SEED OF THE RANDOM NUMBER GENERATORS

by Tae-soo Kim, Young-kyun Yang
"... Abstract. A good arithmetic random number generator should possess full period, uniformity and independence, etc. To obtain the excellent random number generator, many researchers have found good parameters. Also an initial seed is the important factor in random number generator. But, there is no th ..."
Abstract - Add to MetaCart
Abstract. A good arithmetic random number generator should possess full period, uniformity and independence, etc. To obtain the excellent random number generator, many researchers have found good parameters. Also an initial seed is the important factor in random number generator. But

PSEUDO-RANDOM NUMBER GENERATOR

by Clement C. Y. Lam, B. Eng (mcmaster , 1977
"... ii A simple and inexpensive pseudo-random number generator has been designed and built using linear feed-back shift registers to generate rectangular and gaussian distributed numbers. The device has been interfaced to a Nova computer to provide a high speed source of random numbers. The two distribu ..."
Abstract - Add to MetaCart
ii A simple and inexpensive pseudo-random number generator has been designed and built using linear feed-back shift registers to generate rectangular and gaussian distributed numbers. The device has been interfaced to a Nova computer to provide a high speed source of random numbers. The two

Computational Alternatives to Random Number Generators

by David M'Raïhi, David Naccache , David Pointcheval , Serge Vaudenay - SELECTED AREAS IN CRYPTOGRAPHY , 1999
"... In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). By ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). By

Uniform Random Number Generators for Supercomputers

by Richard P. Brent - Proc. Fifth Australian Supercomputer Conference , 1992
"... We consider the requirements for uniform pseudo-random number generators on modern vector and parallel supercomputers, consider the pros and cons of various classes of methods, and outline what is currently available. We propose a class of random number generators which have good statistical propert ..."
Abstract - Cited by 35 (14 self) - Add to MetaCart
We consider the requirements for uniform pseudo-random number generators on modern vector and parallel supercomputers, consider the pros and cons of various classes of methods, and outline what is currently available. We propose a class of random number generators which have good statistical

Evaluating Parallel Random Number Generators

by William Mahoney, Paul D. Coddington
"... Parallel random number generators are studied and tested on a variety of parallel computers. The performance of each random number generator is evaluated using parallel Monte Carlo simulations. A model with known results is used to enable a more precise analysis of each random number generator. The ..."
Abstract - Add to MetaCart
Parallel random number generators are studied and tested on a variety of parallel computers. The performance of each random number generator is evaluated using parallel Monte Carlo simulations. A model with known results is used to enable a more precise analysis of each random number generator

Source codes as random number generators

by Karthik Visweswariah, Student Member, Sanjeev R. Kulkarni, Senior Member, Sergio Verdú - IEEE Trans. Inform. Theory , 1998
"... Abstract—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asymptotically fair coin flips from a stationary ergodic source at a rate of bits per source symbol equal to the entro ..."
Abstract - Cited by 21 (1 self) - Add to MetaCart
Abstract—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asymptotically fair coin flips from a stationary ergodic source at a rate of bits per source symbol equal

PUF-based random number generation

by Charles W. O’donnell, G. Edward Suh, Srinivas Devadas - In MIT CSAIL CSG Technical Memo 481 (http://csg.csail.mit.edu/pubs/memos/Memo-481/Memo-481.pdf , 2004
"... From security to randomized algorithms, there are many existing problems whose solutions are fundamentally based on the assumption that intrinsically pure random number sources exist. Pseudorandom number generators can imitate randomness sufficiently well for most applications, however, they still r ..."
Abstract - Cited by 13 (3 self) - Add to MetaCart
From security to randomized algorithms, there are many existing problems whose solutions are fundamentally based on the assumption that intrinsically pure random number sources exist. Pseudorandom number generators can imitate randomness sufficiently well for most applications, however, they still

Uniform Random Number Generators for Supercomputers

by unknown authors
"... We consider the requirements for uniform pseudo-random number generators on modern vector and parallel supercomputers, consider the pros and cons of various classes of methods, and outline what is currently available. We propose a class of random number generators which have good statistical propert ..."
Abstract - Add to MetaCart
We consider the requirements for uniform pseudo-random number generators on modern vector and parallel supercomputers, consider the pros and cons of various classes of methods, and outline what is currently available. We propose a class of random number generators which have good statistical
Next 10 →
Results 11 - 20 of 115,203
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University