In this paper we propose a universal forgery attack of Hess’s second IDbased signature scheme against the known-message attack.

This paper shows that all shared atomic object types that can solve consensus among k > 1 processes have the same weakest failure detector in a message passing system with process crash failures. In such a system, object types such as test-and-set, fetch-and-add, and queue, known to have weak synchronization power in a shared memory system are thus, in a precise sense, equivalent to universal t...

Let d ≥ 1 be an integer and R1 be a finite ring whose elements are called block. A d-block universal hash over R1 is a vector of d multivariate polynomials in message and key block such that the maximum differential probability of the hash function is “low”. Two such single block hashes are pseudo dot-product (PDP) hash and BernsteinRabin-Winograd (BRW) hash which require n 2 multiplications fo...

We describe a construction of almost universal hash functions suitable for very fast software implementation and applicable to the hashing of variable size data and fast cryptographic message authenti-cation. Our construction uses fast single precision arithmetic which is increasingly supported by modern processors due to the growing needs for fast arithmetic posed by multimedia applications. W...

Multimedia messaging is expected to become a major application for next generation mobile computing and communication devices. Heterogeneous capabilities of these devices, however, require adaptation of multimedia messages before rendering on any specific device. To achieve this in case of video messages, video analysis has to be performed to extract the structure of the video and control the m...

A digest function is a sort of universal hash that takes a key and a message as its inputs. This paper will study these functions’ properties and design in the context of their application in manual authentication technology. Frequently a digest function needs to have a very short output (e.g. 16–32 bits) and no key is used to digest more than one message. These together with other characterist...

This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authen-tication. First, we describe a simple but novel family of universal hash functions that is more eecient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk 13]. All the main techniques used to optimize MMH...

This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authen-tication. First, we describe a simple but novel family of universal hash functions that is more eecient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk 12]. All the main techniques used to optimize MMH...