2237 search results - page 168 / 448 » On the Security of Random Sources |
169
click to vote
WSC
2001
15 years 8 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
172
click to vote
CTRSA
2005
Springer
16 years 13 days ago
2005
Springer
HTTP session-id’s take an important role in almost any web site today. This paper presents a cryptanalysis of Java Servlet 128-bit session-id’s and an efficient practical predi...
180
click to vote
CRYPTO
2004
Springer
16 years 11 days ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
178
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
146
click to vote
IJISEC
2002
15 years 6 months ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...