Sciweavers

12438 search results - page 36 / 2488
» The Magic of a Number System
Sort
View
FSE
1998
Springer
102views Cryptology» more  FSE 1998»
15 years 6 months ago
Cryptanalytic Attacks on Pseudorandom Number Generators
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, "random" nonces, and other values...
John Kelsey, Bruce Schneier, David Wagner, Chris H...
109
Voted
PODC
2010
ACM
15 years 5 months ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal
99
Voted
SPIRE
2007
Springer
15 years 8 months ago
Estimating Number of Citations Using Author Reputation
We study the problem of predicting the popularity of items in a dynamic environment in which authors post continuously new items and provide feedback on existing items. This proble...
Carlos Castillo, Debora Donato, Aristides Gionis
116
Voted
ACSAC
2003
IEEE
15 years 7 months ago
Practical Random Number Generation in Software
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
John Viega
CDC
2008
IEEE
122views Control Systems» more  CDC 2008»
15 years 8 months ago
On the number of leaders needed to ensure network connectivity
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...
Dimos V. Dimarogonas, Tove Gustavi, Magnus Egerste...