Results 11  20
of
200,502
A Proactive PseudoRandom Generator
"... A major security threat to any security solutions based on a centralized server is the possibility ofan adversary gaining access to and taking control of the server. The adversary may then learn secrets, corrupt data, or send erroneous messages. In practice, such an adversary may be more prevalent t ..."
Abstract
 Add to MetaCart
) of the servers must be compromised simultaneously in order to compromise the system. This paper describes the Network Randomization Protocol (NRP)  a proactive protocol for generating cryptographically secure pseudorandom numbers. The protocol is designed for operation in the Internet and includes defenses
Comparison Between Random and PseudoRandom Generation for
 BIST of Delay, Stuckat and Bridging Faults”, IEEE OnLine Testing Workshop
, 2000
"... The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. As delay testing using external testers requires expensive ATE, builtin self test (BIST) is an alternative technique that ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
delay fault coverage is targeted. In this paper, we first question the use of a pseudorandom generation to produce effective delay test pairs. We demonstrate that using truly random test pairs (produced from a software generation) to test path delay faults in a given circuit produces higher delay fault
How strong is Nisan’s pseudorandom generator?
, 2010
"... We study the resilience of the classical pseudorandom generator (PRG) of Nisan [Nis92] against spacebounded machines that make multiple passes over the input. Our motivation comes from the derandomization of BPNC1. Observe that if for every logspace machine that reads its input nO(1) times there ..."
Abstract
 Add to MetaCart
We study the resilience of the classical pseudorandom generator (PRG) of Nisan [Nis92] against spacebounded machines that make multiple passes over the input. Our motivation comes from the derandomization of BPNC1. Observe that if for every logspace machine that reads its input nO(1) times
RSFQ Pseudo Random Generator and Its Possible Applications
 IEEE Trans. Appl. Supercond
, 1995
"... We have analyzed theoretically and simulated a set of 4bits RSFQlogicbased Pseudo Random Generators (PRG). These circuits have been fabricated using lowTC Niobium technology. We have also investigated experimentally an XOR cell and a shift register with parallel outputs that have been used as co ..."
Abstract
 Add to MetaCart
We have analyzed theoretically and simulated a set of 4bits RSFQlogicbased Pseudo Random Generators (PRG). These circuits have been fabricated using lowTC Niobium technology. We have also investigated experimentally an XOR cell and a shift register with parallel outputs that have been used
An improved pseudorandom generator based on discrete log
 Journal of Cryptology
, 2000
"... Abstract. Under the assumption that solving the discrete logarithm problem modulo an nbit prime p is hard even when the exponent is a small cbit number, we construct a new and improved pseudorandom bit generator. This new generator outputs n − c − 1 bits per exponentiation with a cbit exponent. ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
Abstract. Under the assumption that solving the discrete logarithm problem modulo an nbit prime p is hard even when the exponent is a small cbit number, we construct a new and improved pseudorandom bit generator. This new generator outputs n − c − 1 bits per exponentiation with a cbit exponent
Hybrid Technique Application: PseudoRandom Generators
, 2010
"... ◮ Proof by reduction Remarks, questions, comments? 2 / 52Models and analysis of security protocols 1st Semester 20102011 Public Encryption Lecture 4 Outline of Today: ..."
Abstract
 Add to MetaCart
◮ Proof by reduction Remarks, questions, comments? 2 / 52Models and analysis of security protocols 1st Semester 20102011 Public Encryption Lecture 4 Outline of Today:
Pseudorandom generators and structure of complete degrees
 In 17th Annual IEEE Conference on Computational Complexity
, 2002
"... It is shown that if there exist sets in E that requiresized circuits then sets that are hard for class P, and above, under 11 reductions are also hard under 11, sizeincreasing reductions. Under the assumption of the hardness of solving RSA or Discrete Log problem, it is shown that sets that are h ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
It is shown that if there exist sets in E that requiresized circuits then sets that are hard for class P, and above, under 11 reductions are also hard under 11, sizeincreasing reductions. Under the assumption of the hardness of solving RSA or Discrete Log problem, it is shown that sets that are hard for class NP, and above, under manyone reductions are also hard under (nonuniform) 11, and sizeincreasing reductions. 1
Simple Extractors for All MinEntropies and a New PseudoRandom Generator
"... We present a simple, selfcontained extractor construction that produces good extractors for all minentropies (minentropy measures the amount of randomness contained in a weak random source). Our construction is algebraic and builds on a new polynomialbased approach introduced by TaShma, Zuckerm ..."
Abstract

Cited by 107 (26 self)
 Add to MetaCart
] to small k has been the focus of a sequence of recent works [15, 26, 35]. Our construction gives a much simpler and more direct solution tothis problem. Applying similar ideas to the problem of building pseudorandom generators, we obtain a new pseudorandom generator construction that is not based
An Efficient PseudoRandom Generator Provably as Secure as Syndrome Decoding
, 1996
"... . We show a simple and efficient construction of a pseudorandom generator based on the intractability of an NPcomplete problem from the area of errorcorrecting codes. The generator is proved as secure as a hard instance of the syndrome decoding problem. Each application of the scheme generates a l ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
linear amount of bits in only quadratic computing time. 1 Introduction A pseudorandom generator is an algorithm producing strings of bits that look random. The concept of "randomly looking" has been formalized by Blum and Micali [4] within the framework of complexity theory. Yao [22] has
Results 11  20
of
200,502