133 search results - page 7 / 27 » Reduced Complexity Attacks on the Alternating Step Generator |
WS
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
ACSAC
2005
IEEE
14 years 28 days ago
2005
IEEE
Honeyd [14] is a popular tool developed by Niels Provos that offers a simple way to emulate services offered by several machines on a single PC. It is a so called low interaction ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
FSE
1998
Springer
13 years 11 months ago
1998
Springer
Ding et al [DNRS97] propose a stream generator based on several layers. We present several attacks. First, we observe that the non-surjectivity of a linear combination step allows ...