Efficient Parallel Pseudo-Random Number Generation.

Abstract

A number of parallel randomized algorithms have appeared recently. These algorithms typically use a large number of random bits which must be generated in a small amount of time. Nonetheless, the area of parallel random bit generation remains unexplored. This document presents a parallel algorithm for pseudo-random number generation. (Keywords: polynomials; cryptology; statistical tests; theorems; sequences(mathematics); circuits; multiplicative inverse problem).

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1984
Accession Number
ADA152235

Entities

People

  • J. D. Tygar
  • J. H. Reif

Organizations

  • Harvard University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Cryptography
  • Demographic Cohorts
  • Inverse Problems
  • Mathematical Analysis
  • Mathematics
  • Polynomials
  • Sequences
  • Statistical Algorithms
  • Statistical Tests

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Military History of the United States in the 20th Century.
  • Parallel and Distributed Computing.