Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 23 for “"Random number generation"”.

  1. Random Number Generation Using a Biased Source

    We study random number generation using a biased source motivated by previous works on this topic, mainly, von Neumman (1951), Elias (1972), Knuth and Yao (1976) and Peres (1992). We study the problem in two cases: first, when the source distribution is unknown, and second, when the source …

    uiuc Repository record for Random Number Generation Using a Biased Source (opens in a new tab)

  2. Photon Arrival Time Quantum Random Number Generation

    A quantum random number generator (QRNG) is one which re- lies on a physical process, extracting randomness from the inherent uncertainty in quantum mechanics. This is to be contrasted with current pseudo-random number generators (PRNG), which although useful, are in fact deterministic: they always …

    uiuc Repository record for Photon Arrival Time Quantum Random Number Generation (opens in a new tab)

  3. Optical quantum random number generation: applications of single-photon event timing

    … the field of quantum information. For example, random number generators are used in almost all areas of science, and the initial portion of this work details the theory, design, and characterization of two photon-arrival-time quantum random number generators (QRNGs). After the QRNGs were …

    uiuc Repository record for Optical quantum random number generation: applications of single-photon event timing (opens in a new tab)

  4. A Study on Energy Harvesters for Physical Unclonable Functions and Random Number Generation

    … issue. Physical unclonable functions (PUFs) and random number generators (RNGs) provide methods to generate security keys for data encryption. Transducers used in the energy harvesting systems of wireless sensor nodes, can generate the PUFs and RNGs. These transducers include piezoelectric …

    vt Repository record for A Study on Energy Harvesters for Physical Unclonable Functions and Random Number Generation (opens in a new tab)

  5. Flash Memory For Ubiquitous Hardware Security Functions

    … provide three important security functions: true random number generation, digital fingerprinting and information hiding. Use of random telegraph noise (a type of quantum noise source in highly scaled Flash memory cells) enables high quality true random number generation at a rate up to 10Kbits / …

    cornell Repository record for Flash Memory For Ubiquitous Hardware Security Functions (opens in a new tab)

  6. A portable C random number generator

    … sizes has led to increases in software use where random number generation is required. Several techniques have been developed. Criteria of randomness, portability, period, reproducibility, variety, speed, and storage are used to evaluate developed generation methods. The Tausworthe method is the …

    vt Repository record for A portable C random number generator (opens in a new tab)

  7. Testing Primitive Polynomials for Generalized Feedback Shift Register Random Number Generators

    … of generalized feedback shift register (GFSR) random number generators was a promising method for random number generation in the 1980's, but was abandoned because of some flaws such as poor performance on certain tests for randomness. The poor performance may be due to the choice of primitive …

    byu Repository record for Testing Primitive Polynomials for Generalized Feedback Shift Register Random Number Generators (opens in a new tab)

  8. Flexible and Lightweight Cryptographic Engines for Constrained Systems

    … key encryption, hash computation and pseudo-random-number-generation. The implementation results on a Spartan-3 s50 FPGA show that the proposed engines occupies 90 and 95 slices respectively, which are more compact than the majority of their single purpose counterparts. Therefore, these …

    vt Repository record for Flexible and Lightweight Cryptographic Engines for Constrained Systems (opens in a new tab)

  9. A Simulation Analysis of Bivariate Availability Models

    … The study includes exploration of bivariate random number generation. The random data is utilized in estimating the bivariate renewal function and bivariate availability function. The two measures provide insight on system behavior characterized by multiple variables. A method for generating …

    vt Repository record for A Simulation Analysis of Bivariate Availability Models (opens in a new tab)

  10. Domain-Specific Analog Physical Computing Accelerators

    … as motivation for the fast and efficient generation of non-uniform random variates in hardware. Using simulations and real-world empirical measurements this dissertation shows that software non-uniform random number generation is slow and inefficient, and discusses why this is the case. …

    cambridge Repository record for Domain-Specific Analog Physical Computing Accelerators (opens in a new tab)

  11. Uncertainty Analysis of Biological Nonlinear Models Based on Bayesian Estimation

    … biological models. Parameter estimation, random number generation, and uncertainty analysis are closely related in Monte Carlo simulation based model assessment. All three aspects are discussed in this study. Because of the complexity of models and inflexibility of estimation methods, …

    uiuc Repository record for Uncertainty Analysis of Biological Nonlinear Models Based on Bayesian Estimation (opens in a new tab)

  12. Surplus and Scarce Energy: Designing and Optimizing Security for Energy Harvested Internet of Things

    … applications, namely bulk encryption and true random number generation, and we show that precomputing improves energy efficiency and algorithm latency in both applications. Second, we analyze the security pitfalls in transiently powered devices. To secure transiently powered devices, we propose …

    vt Repository record for Surplus and Scarce Energy: Designing and Optimizing Security for Energy Harvested Internet of Things (opens in a new tab)

  13. Vector Instruction Set Extensions for Efficient and Reliable Computation of Keccak

    … hashing, authenticated encryption, key-stream generation and random-number generation. Keccak is the basis of the SHA-3 standard and the newly proposed Keyak and Ketje authenticated ciphers. For reliability, we propose a set of trusted instructions to verify the integrity of a cryptographic …

    vt Repository record for Vector Instruction Set Extensions for Efficient and Reliable Computation of Keccak (opens in a new tab)

  14. Analogue-Domain Machine Learning Computations Exploiting 2D Materials Properties

    … has resulted in a significant increase in the number of ML accelerators. However, many of these accelerators rely on conventional CMOS technology and so are subject to the same issues of scalability, a limitation known as the *accelerator wall*. Thus, new materials and devices are of interest. …

    cambridge Repository record for Analogue-Domain Machine Learning Computations Exploiting 2D Materials Properties (opens in a new tab)

  15. Optimal Codes and Entropy Extractors

    … both Coding Theory and Entropy Extraction for Random Number Generators to be used for cryptographic purposes. We start from a thorough analysis of known bounds on code parameters and a study of the properties of Hadamard codes. We find of particular interest the Griesmer bound, which is a …

    trento Repository record for Optimal Codes and Entropy Extractors (opens in a new tab)

  16. Fast simulation of stochastic biochemical reaction networks on cytomorphic chips

    … require ex- pensive Gillespie algorithms and random-number generation for accurate simulations; and, they routinely operate with nonlinear statics and dynamics. Hence, such simulations are extremely computationally intensive and have remained an important bottleneck in computational biology …

    mit Repository record for Fast simulation of stochastic biochemical reaction networks on cytomorphic chips (opens in a new tab)

  17. Believe It or Not: Examining the Case for Intuitive Logic and Effortful Beliefs

    … longer to complete and were more affected by random number generation (RNG) (Experiment 5). To reconcile these findings we examined the role of Working Memory (WM) and Inhibition in Experiments 7 – 9 and found, contrary to Experiment 5, belief judgments were more demanding of executive …

    plymouth Repository record for Believe It or Not: Examining the Case for Intuitive Logic and Effortful Beliefs (opens in a new tab)

  18. Accelerating Probabilistic Computing with a Stochastic Processing Unit

    … probabilistic architecture to accelerate Markov Random Field (MRF) Gibbs Sampling by utilizing the quantum randomness of optical-molecular devices---Resonance Energy Transfer (RET) networks. We provide a macro-scale prototype, the first such system to our knowledge, to experimentally demonstrate …

    duke Repository record for Accelerating Probabilistic Computing with a Stochastic Processing Unit (opens in a new tab)

  19. Security of Lightweight Cryptographic Primitives

    … rely on lightweight primitives such as pseudorandom number generators, or PRNGs.This thesis explores the effectiveness, functionality, and use of PRNGs in different applications. First, this thesis investigates the confidentiality of a single-stage residue number system PRNG, which has …

    vt Repository record for Security of Lightweight Cryptographic Primitives (opens in a new tab)

  20. A Statistical Evaluation of Algorithms for Independently Seeding Pseudo-Random Number Generators of Type Multiplicative Congruential (Lehmer-Class).

    <p>To be effective, a linear congruential random number generator (LCG) should produce values that are (a) uniformly distributed on the unit interval (0,1) excluding endpoints and (b) substantially free of serial correlation. It has been found that many statistical methods produce inflated Type I …

    etsu Repository record for A Statistical Evaluation of Algorithms for Independently Seeding Pseudo-Random Number Generators of Type Multiplicative Congruential (Lehmer-Class). (opens in a new tab)

Page 1 of 2