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 22 for “"Pseudorandom Number Generator"”.

  1. Multiprime Blum-Blum-Shub pseudorandom number generator

    … (BBS) is a (probabilistically) secure pseudorandom bit/number generator which outputs a sequence by repeatedly reducing squares modulo the product of two Blum-primes. Our goal for this thesis is to modify the algorithm by using a modulus which is the product of three Blum-primes.We …

    nps Repository record for Multiprime Blum-Blum-Shub pseudorandom number generator (opens in a new tab)

  2. A multi-threaded cryptographic pseudorandom number generator test suite

    There are multiple applications for pseudorandom number generators, notably in simulation and cryptography. A bad pseudorandom number generator can cause misleading results in simulations or loss of security and attacks against implementations of cryptographic systems with low-entropy sequences. …

    nps Repository record for A multi-threaded cryptographic pseudorandom number generator test suite (opens in a new tab)

  3. Nonquadratic variation of the Blum-Blum-Shub Pseudorandom Number Generator

    … One such source of this randomness is a random number generator. This thesis focuses on Pseudorandom Number Generators (PRNG), specifically, a PRNG called Blum-Blum-Shub (BBS). In this thesis, we make two modifications to BBS, and test our modified generators for randomness using the National …

    nps Repository record for Nonquadratic variation of the Blum-Blum-Shub Pseudorandom Number Generator (opens in a new tab)

  4. INVESTIGATING MAXIMUM BIT EXTRACTION OF THE BLUM-MICALI PSEUDORANDOM NUMBER GENERATOR

    The Blum-Micali pseudorandom number generator (PRNG outputs cryptographically secure random bits, and while previous research suggests that there is an upper limit on the number of bits which can be securely extracted, most of this work is theoretical. This work builds upon previous research which …

    nps Repository record for INVESTIGATING MAXIMUM BIT EXTRACTION OF THE BLUM-MICALI PSEUDORANDOM NUMBER GENERATOR (opens in a new tab)

  5. DIVIDE AND CONQUER MODIFICATION OF THE BLUM-MICALI PSEUDORANDOM NUMBER GENERATOR

    The Blum-Micali pseudorandom number generator (PRNG) outputs cryptographically secure sequences of pseudorandom bits. One of the primary drawbacks of the Blum-Micali PRNG is that it can be computationally expensive and slow to run. This thesis proposes a modification to the Blum-Micali PRNG that …

    nps Repository record for DIVIDE AND CONQUER MODIFICATION OF THE BLUM-MICALI PSEUDORANDOM NUMBER GENERATOR (opens in a new tab)

  6. A Trivium-Inspired Pseudorandom Number Generator with a Statistical Comparison to the Randomness of SecureRandom and Trivium

    A pseudorandom number generator (PRNG) is an algorithm that produces a sequence of numbers which emulates the characteristics of a random sequence. In comparison to its genuine counterpart, PRNGs are considered more suitable for computing devices in that they do not consume a lot of resources (in …

    columbus-state Repository record for A Trivium-Inspired Pseudorandom Number Generator with a Statistical Comparison to the Randomness of SecureRandom and Trivium (opens in a new tab)

  7. On a proposed symbolic dynamics for the Hénon map

    … yet cryptologically robust rule for generating pseudorandom bitstreams cannot be overstated. In most applications we strive to detect and avoid chaotic behavior; here we embrace a particular chaotic discrete dynamical system to exploit its use as a driver for a pseudorandom number generator. The …

    nps Repository record for On a proposed symbolic dynamics for the Hénon map (opens in a new tab)

  8. Spectral analysis of random number generators

    … we describe a method for testing the fairness of pseudorandom number generators using the Discrete Fourier Transform. We will show how the concept of a random process can be used in a representation for random discrete time signals. Using this concept, we have focused on the mathematical …

    unlv Repository record for Spectral analysis of random number generators (opens in a new tab) Download PDF for Spectral analysis of random number generators (opens in a new tab)

  9. A Secure, Low Power and Low Hardware Digital Watermarking System for Real-time Surveillance Video Authentication

    … source of low hardware cryptographically secure pseudorandom number generator to generate a secure watermark sequence. The system was also assessed based on different recognized watermarking attacks and the proposed threat model to provide evidence for the achievement of the security goals.

    calgary Repository record for A Secure, Low Power and Low Hardware Digital Watermarking System for Real-time Surveillance Video Authentication (opens in a new tab)

  10. A Performance Analysis of the Minimax Multivariate Quality Control Chart

    … charts under consideration differ in the number of quality characteristic variables of concern. In each case, without loss of generality the in-control quality characteristic mean vector is assumed to have zero entries and the associated covariance matrix is assumed to have non-negative …

    vt Repository record for A Performance Analysis of the Minimax Multivariate Quality Control Chart (opens in a new tab)

  11. DOUBLE PENDULUM CHAOTIC MODEL FOR PSEUDORANDOM NUMBER GENERATION

    … of the masses, resulting in an infinite number of possible motion paths. The chaotic motion paths produced by the double pendulum can be exploited to produce binary sequences. This thesis focuses on determining if the chaotic motion of the double pendulum can be used as a pseudorandom …

    nps Repository record for DOUBLE PENDULUM CHAOTIC MODEL FOR PSEUDORANDOM NUMBER GENERATION (opens in a new tab)

  12. Pseudorandom number generators using multiple sources of entropy

    … This paper looks to bridge this gap. Research in pseudorandom number generation has gone on for decades. However, many of the past constructions were lacking in either documentation or provable security of their methods. The need for a pseudorandom number generator (PRG) with provable security and …

    uvic Repository record for Pseudorandom number generators using multiple sources of entropy (opens in a new tab)

  13. Analysis of synchronizations in greedy-scheduled executions and applications to efficient generation of pseudorandom numbers in parallel

    … SIPS analysis, a novel approach to estimate the number of synchronizations performed during the execution of a parallel algorithm. Based on the concept of logical clocks, it allows us: on one hand, to deliver new bounds for the number of synchronizations, in expectation; on the other hand, to …

    brazil-ufrgs Repository record for Analysis of synchronizations in greedy-scheduled executions and applications to efficient generation of pseudorandom numbers in parallel (opens in a new tab)

  14. Design and Analysis of Cryptographic Pseudorandom Number/Sequence Generators with Applications in RFID

    … nonlinear feedback shift register (NLFSR) based pseudorandom number generators for radio frequency identification (RFID) tags. We study the generation of span n sequences using structured searching in which an NLFSR with a class of feedback functions is employed to find span n sequences. Some …

    waterloo Repository record for Design and Analysis of Cryptographic Pseudorandom Number/Sequence Generators with Applications in RFID (opens in a new tab)

  15. Optimized Hardware Implementations of Lightweight Cryptography

    … family, the WG-8 stream cipher, the Warbler pseudorandom number generator (PRNG), and the WGLCE cryptographic engine. Simeck is a new family of lightweight block ciphers. Simeck takes advantage of the good components and design ideas of the Simon and Speck block ciphers and it has three …

    waterloo Repository record for Optimized Hardware Implementations of Lightweight Cryptography (opens in a new tab)

  16. Analysis of Lightweight Cryptographic Primitives

    … The first is a single-stage residue number system (RNS) pseudorandom number generator (PRNG) that was shown in previous publications to produce strong outputs when analyzed with statistical tests like the NIST RNG test suite and DIEHARD. However, through analysis, an intelligent …

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

  17. Hyperchaotic Noise Generation for Adversarial Encryption in Privacy-Preserving Image Classification

    … However, RIC's cover generation relies on a pseudorandom number generator with a small, finite seed space, limiting its key-based security guarantees. This thesis replaces RIC's pseudorandom cover with noise drawn from chaotic and hyperchaotic dynamical systems: a 3D Lorenz system and 4D …

    calpoly Repository record for Hyperchaotic Noise Generation for Adversarial Encryption in Privacy-Preserving Image Classification (opens in a new tab)

  18. Security of Lightweight Cryptographic Primitives

    … and must 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)

  19. Generátory náhodných čísel

    Tato práce se zabývá metodami generování pseudonáhodných čísel. Zaměřuje se na softwarové generátory. Jsou zde rozděleny generátory pseudonáhodných čísel podle způsobu generování a popsány jednotlivé typy. Další část popisuje metody testování kvality generátorů náhodných a pseudonáhodných čísel. …

    brno-tech Repository record for Generátory náhodných čísel (opens in a new tab)

  20. Uncertainty quantification in computations with protein structures and complexes

    … these low-discrepancy points, we implement a pseudorandom number generator which is able to, both theoretically and practically (as we show in this thesis), generate points with lower discrepancy than other commonly-used generators. We use these low-discrepancy points to compute the remainder …

    texas Repository record for Uncertainty quantification in computations with protein structures and complexes (opens in a new tab)

Page 1 of 2