Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,211,760 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
AC0
Algorithm
Circuit complexity
Computational complexity theory
Expand
Broader (1)
Algorithmic information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Pseudorandomness for Read-Once Formulas
Andrej Bogdanov
,
Periklis A. Papakonstantinou
,
Andrew Wan
IEEE Annual Symposium on Foundations of Computer…
2011
Corpus ID: 10555135
We give an explicit construction of a pseudorandom generator for read-once formulas whose inputs can be read in arbitrary order…
Expand
2010
2010
More efficient DDH pseudorandom generators
Hongsong Shi
,
Shaoquan Jiang
,
Zhiguang Qin
Des. Codes Cryptogr.
2010
Corpus ID: 18161125
In this paper, we first show a DDH Lemma, which states that a multi-variable version of the decisional Diffie–Hellman problem is…
Expand
Highly Cited
2008
Highly Cited
2008
A study on secure RFID mutual authentication scheme in pervasive computing environment
Sooyoung Kang
,
Deok-Gyu Lee
,
Imyeong Lee
Computer Communications
2008
Corpus ID: 2497889
2008
2008
Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
F. Arnault
,
T. Berger
,
M. Minier
IEEE Transactions on Information Theory
2008
Corpus ID: 2780710
This article describes new theoretical results concerning the general behavior of a feedback with carry shift register (FCSR…
Expand
Highly Cited
2005
Highly Cited
2005
On constructing parallel pseudorandom generators from one-way functions
Emanuele Viola
Cybersecurity and Cyberforensics Conference
2005
Corpus ID: 7699725
We study pseudorandom generator (PRG) constructions G/sup f/ : {0, 1}/sup l/ /spl rarr/ {0, 1}/sup 1+s/ from one-way functions f…
Expand
2001
2001
Private Information Retrieval Based on the Subgroup Membership Problem
A. Yamamura
,
Taiichi Saito
Australasian Conference on Information Security…
2001
Corpus ID: 2300909
Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the…
Expand
1999
1999
On the Development of Block-Ciphers and Pseudo-Random Function Generators Using the Composition and
S. Myers
1999
Corpus ID: 118591635
On the Development of Block-Ciphers and Pseudo-Random Function Generators Using the Composition and XOR Operators Steven A. Myers…
Expand
1998
1998
Pseudorandom generator based on clipped Hopfield neural network
Chi-Kwong Chan
,
L.M. Cheng
ISCAS '98. Proceedings of the IEEE International…
1998
Corpus ID: 62754677
We present a new construction of a pseudorandom generator based on a single linear feedback shift register and a clipped version…
Expand
1994
1994
Space lower-bounds for pseudorandom-generators
Xiangdong Yu
,
M. Yung
Proceedings of IEEE 9th Annual Conference on…
1994
Corpus ID: 8321588
Pseudorandom generation is a fundamental notion with many applications such as cryptography and deterministic simulation of…
Expand
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…
Expand
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)
ACCEPT & CONTINUE