Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
Ron Steinfeld, Scott Contini, Krystian Matusiewicz...
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
In this paper we present a new technique to simulate polymer blends that overcomes the shortcomings in polymer system modeling. This method has an inherent advantage in that the v...
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...