Sciweavers

13214 search results - page 1 / 2643
» Pseudorandomness for network algorithms
Sort
View
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
13 years 9 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
TCS
2002
13 years 5 months ago
A comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
Yongge Wang
IJNSEC
2010
104views more  IJNSEC 2010»
13 years 17 days ago
Construction of Large Families of Pseudorandom Subsets of the Set {1, 2, ..., N} Using Elliptic Curves
Pseudo-random subsets of the set {1, 2, . . . , N} have many applications in the fields of network security, cryptography and other security issues. Recently, Dartyge and S
Zhixiong Chen, Li Xu, Chenhuang Wu
SRDS
2007
IEEE
14 years 14 hour ago
Distributed Software-based Attestation for Node Compromise Detection in Sensor Networks
Sensors that operate in an unattended, harsh or hostile environment are vulnerable to compromises because their low costs preclude the use of expensive tamper-resistant hardware. ...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
CSREASAM
2009
13 years 6 months ago
Tantra: A Fast PRNG Algorithm and its Implementation
Tantra 1 is a novel Pseudorandom number generator (PRNG) design that provides a long sequence high quality pseudorandom numbers at very high rate both in software and hardware impl...
Mahadevan Gomathisankaran, Ruby Lee