Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,944 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.
2017
2017
On the Existence of Extractable One-Way Functions
K. Baghery
2017
Corpus ID: 7747931
Extractability is one of the main and central tools for design and analysis of modern cryptographic protocols. We say a function…
Expand
2013
2013
Securing network coding against pollution attacks in P2P converged ubiquitous networks
Ming He
,
Z. Gong
,
Lin Chen
,
Hong Wang
,
Fan Dai
,
Zhihong Liu
Peer-to-Peer Networking and Applications
2013
Corpus ID: 33909638
Network coding has emerged as a promising approach for peer-to-peer converged ubiquitous networks to increase network capacity…
Expand
2012
2012
Position-Verification in Multi-Channel Model
Huajun Zhang
,
Zongyang Zhang
,
Z. Cao
2012
Corpus ID: 14768187
We propose an efficient collusion-attack-resistant position-verification protocol in a new model named multi-channel model. In…
Expand
2005
2005
ABC : A New Fast Flexible Stream Cipher Specification Version 2
V. Anashin
,
A. Bogdanov
,
Ilya Kizhvatov
,
Sandeep S. Kumar
2005
Corpus ID: 13156213
ABC is a synchronous stream cipher optimized for software applications. Its key length is 128 bits. It accommodates a 128-bit…
Expand
2004
2004
Design of new pseudorandom generators based on a filtered FCSR automaton
F. Arnault
,
T. Berger
2004
Corpus ID: 16451338
Feedback with Carry Shift Registers (FCSR) were introduced by M. Goresky and A. Klapper in 1993. They are very similar to…
Expand
2003
2003
Provable secure scalable block ciphers
Lenka Fibíková
2003
Corpus ID: 16677073
Beweisbare Sicherheit und Skalierbarkeit sind zwei wunschenswerte Eigenschaften einer Blockchiffre. Die erste garantiert, dass…
Expand
1995
1995
Pseudorandom Sequences obtained from Expansions of IrrationalNumbers
Hossein
,
GhodosiChris
,
CharnesJosef
,
PieprzykRei
,
-. Safavi
,
NainiDepartment
1995
Corpus ID: 18959807
The main challenge in stream cipher design is to produce sequences that appear random. A number of keystream generators have been…
Expand
1993
1993
An ALU-based programmable MISR/pseudorandom generator for a MC68HC11 family self-test
James Broseghini
,
D. Lenhert
International Test Conference
1993
Corpus ID: 8231872
This paper describes an ALU-based self-test system implemented on a MC68HC11 Family microcontroller. A fully programmable…
Expand
1992
1992
Time-space tradeoffs for graph S-T connectivity
G. Barnes
1992
Corpus ID: 124336998
The problem of graph s-t connectivity, determining whether two vertices s and t in a graph are in the same connected component…
Expand
1990
1990
Scan test architectures for digital board testers
M. L. Fichtenbaum
,
G. Robinson
Proceedings. International Test Conference
1990
Corpus ID: 1067279
Boundary scan is a method of implementing test access to the terminals of a component, cluster, or board. Although substituting…
Expand