Skip to search formSkip to main contentSkip to account menu

Pseudorandom generator

Known as: Pseudorandom generators 
In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
AC0AlgorithmCircuit complexityComputational complexity theory

Broader (1)

Algorithmic information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Symbolic Security of Garbled Circuits
We present the first computationally sound symbolic analysis of Yao's garbled circuit construction for secure two party… 
2011
2011
Pseudorandomness for Read-Once Formulas
We give an explicit construction of a pseudorandom generator for read-once formulas whose inputs can be read in arbitrary order… 
2010
2010
More efficient DDH pseudorandom generators
In this paper, we first show a DDH Lemma, which states that a multi-variable version of the decisional Diffie–Hellman problem is… 
Highly Cited
2008
Highly Cited
2008
A study on secure RFID mutual authentication scheme in pervasive computing environment
2008
2008
Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
This article describes new theoretical results concerning the general behavior of a feedback with carry shift register (FCSR… 
2007
2007
Fast pseudorandom generator based on packed matrices
Pseudorandom generators are a basic foundation of many cryptographic services and information security protocols. We propose a… 
1999
1999
On the Development of Block-Ciphers and Pseudo-Random Function Generators Using the Composition and
On the Development of Block-Ciphers and Pseudo-Random Function Generators Using the Composition and XOR Operators Steven A. Myers… 
1998
1998
Pseudorandom generator based on clipped Hopfield neural network
We present a new construction of a pseudorandom generator based on a single linear feedback shift register and a clipped version… 
1994
1994
Space lower-bounds for pseudorandom-generators
Pseudorandom generation is a fundamental notion with many applications such as cryptography and deterministic simulation of… 
1992
1992
Using hard problems to create pseudorandom generators
  • N. Nisan
  • ACM Distinguished Dissertations
  • 1992
  • Corpus ID: 6608273
It's not surprisingly when entering this site to get the book. One of the popular books now is the using hard problems to create… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)