133 search results - page 9 / 27 » Reduced Complexity Attacks on the Alternating Step Generator |
ACSC
2005
IEEE
14 years 28 days ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
HYBRID
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
FSE
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differential...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
Media hashing is an alternative to achieve many applications previously accomplished with watermarking. The major disadvantage of the existing media hashing technologies is their ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...