13214 search results - page 17 / 2643 » Pseudorandomness for network algorithms |
ICCD
1993
IEEE
15 years 3 months ago
1993
IEEE
In this paper the design of a high-speed cryptographic coprocessor is presented. This coprocessor is named Subterranean and can be used for both cryptographic pseudorandom sequenc...
80
Voted
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
EUROSYS
2006
ACM
15 years 3 months ago
2006
ACM
This paper describes and evaluates Fireflies, a scalable protocol for supporting intrusion-tolerant network overlays.1 While such a protocol cannot distinguish Byzantine nodes fro...
EUROCRYPT
2009
Springer
16 years 8 days ago
2009
Springer
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
114
click to vote
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...