Sciweavers

5372 search results - page 148 / 1075
» complexity 2007
Sort
View
ICISC
2007
96views Cryptology» more  ICISC 2007»
13 years 9 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
Florian Mendel, Vincent Rijmen
IC
2003
13 years 9 months ago
Marshalgen: A Package for Semi-Automatic Marshaling of Objects
Abstract— Marshaling or serialization of objects is an important component of both distributed and parallel computing. Current systems impose a significant burden on the program...
Gene Cooperman, Ning Ke, Huanmei Wu
NAACL
2003
13 years 9 months ago
A low-complexity, broad-coverage probabilistic Dependency Parser for English
Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this ...
Gerold Schneider
NIPS
1997
13 years 9 months ago
A Non-Parametric Multi-Scale Statistical Model for Natural Images
The observed distribution of natural images is far from uniform. On the contrary, real images have complex and important structure that can be exploited for image processing, reco...
Jeremy S. De Bonet, Paul A. Viola
CANS
2009
Springer
165views Cryptology» more  CANS 2009»
14 years 2 months ago
An Analysis of the Compact XSL Attack on BES and Embedded SMS4
The XSL attack when applied on BES-128 has been shown to have an attack complexity of 2100 , which is faster than exhaustive search. However at FSE 2007, Lim and Khoo analyzed the ...
Jiali Choy, Huihui Yap, Khoongming Khoo