We present a second pre-image attack on ECOH. Our attack requires 2143 time for ECOH-224 and ECOH-256, 2206 time for ECOH-384, and 2287 time for ECOH-512. The attack sets the checksum block to a fixed value and uses a collision search on the elliptic curve points. 1 An outline of ECOH We first give a description of the essential elements of ECOH. We restrict ourselves to messages that are an in...

We present an algorithm that computes the Lempel-Ziv decomposition in O(n(log σ+log log n)) time and n log σ+ǫn bits of space, where ǫ is a constant rational parameter, n is the length of the input string, and σ is the alphabet size. The n log σ bits in the space bound are for the input string itself which is treated as read-only.

We present a multiversioning scheme for a distributed system with the workload consisting of read-only transactions and update transactions, (most of) which commute on individual nodes. The scheme introduces a version advancement protocol that is completely asynchronous with user transactions, thus allowing the system to scale to very high transaction rates and frequent version advancements. Mo...

Deep ownership types gives a strong notion of aggregate by enforcing the so-called owners-as-dominators property: every path from a system root to an object must pass through its owner. Consequently, encapsulated aggregates must have a single bridge object that mediates all external interaction with its internal objects. In this paper, we present an extension of deep ownership that relaxes the ...

Am ajor problem ofe-commerce is the high rate of customer initiated abortions of processes. It may be solved by the implementation of a Push System that supports the webshop. One major module of the Push System is the Pushflow Manager that proactively l eads customers through their processes by taking over tasks or triggering following activities. Its theoretical background, the Push Concepts, ...

When an o p t i c a l sensor t r a n s l a t e s a l o n g a known d i r e c t i o n I n a s t a t i o n a r y w o r l d the r e l a t i v e dep th map of o b j e c t p o i n t s on the s u r f a c e can be e a s i l y o b t a i n e d when some s i m p l i f y i n g assumpt ions a re made. Under these assumpt ions the angu la r speeds o f p r o j e c t i n g r a y s can be o b t a i n e d f rom...

On January 8th 2003, Eric Filiol published on eprint.iacr.org a paper [11] in which he claims that AES can be broken by a very simple and very fast ciphertext-only attack. If such an attack existed, it would be the biggest discovery in code-breaking since some 10 or more years. Unfortunately the result is very hard to believe. In this paper we present the results of computer simulations done by...

The dimens~onali~y of a set Off 160 1:~ :a:~s ~~·. 10 . female subjects IS reduced rom ........ . network The extracted features do not correspond to in previ~us face recognition systems (KaR· na~e, 19~;)y' ......••.•.. d' tances between facial elements. at. er, .. ......\ f~tures we call holons. The hol.ons are fV~~ t~! ..... propagation networks th.at are teamed toc ~:~~~ . y identity. feigne...

Macropodus opercularis were reared in isolation, with conspecifics, or cross-reared with nonconspecifics. As young adults, cross-reared subjects presented with live conspecific and mirror image stimuli performed social displays less frequently than controls, while isolates did not differ from controls. In a spawning trial, no differences were found between groups. These results suggest that exp...

To a large extent, repositories of end-user code are “write-only”: much of the code that people publish never sees substantial reuse. Yet buried within these repositories are valuable pieces of code, though finding them is not always easy. In prior work, we developed a model that can predict, when a web macro is created, whether that script will be reused by anybody. In the current paper, we an...