5100 search results - page 568 / 1020 » The Linear Complexity of a Graph |
190
click to vote
ESORICS
2004
Springer
16 years 6 days ago
2004
Springer
This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys...
189
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
147
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specifica...
161
click to vote
CTRSA
2006
Springer
15 years 10 months ago
2006
Springer
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
183
click to vote
NIPS
2008
15 years 8 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...