Three different implementations of the 3-pass algorithm of image and volume data rotation are illustrated and discussed. The three protocols use interpolation in real domain, with a peculiar implementation of the Shannon reconstruction, or phase shifts in Fourier domain. Accuracy and speed of the three methods are compared with corresponding values obtained with a 1-pass method. The results ind...

The hash function HAVAL is an Australian extension of well known Merkle-Damg̊ard hash functions such as MD4 and MD5. It has three variants, 3-, 4and 5-pass HAVAL. On 3-pass HAVAL, the best known attack finds a collision pair with 2 computations of the compression function. To find k collision pairs, it requires 2k computations. In this paper, we present a better collision attack on 3-pass HAVAL,...

PURPOSE To test the feasibility of first-pass contrast-enhanced myocardial perfusion imaging at 3 Tesla and to evaluate the change in perfusion index between normal, remote and ischemic myocardium, we obtained perfusion index from healthy subjects and patients with coronary artery stenosis. MATERIALS AND METHODS First-pass contrast-enhanced perfusion imaging was performed on 12 patients and 3...

This paper presents preimage attacks on the hash functions 3-pass HAVAL and step-reduced MD5. Introduced in 1992 and 1991 respectively, these functions underwent severe collision attacks, but no preimage attack. We describe two preimage attacks on the compression function of 3-pass HAVAL. The attacks have a complexity of about 2 compression function evaluations instead of 2. We present several ...

This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. This paper has three main contributions; a preimage attack on 3-pass HAVAL at the complexity of 2, a preimage attack on 4-pass HAVAL at the complexity of 2, and a preimage attack on 5-pass HAVAL reduced to 151 steps at the complexity of 2. Moreover, we optimize the computational order for brute-force at...

HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992. It has three variants, 3-, 4-, and 5-pass HAVAL. Previous results on HAVAL suggested only practical collision attacks for 3-pass HAVAL. In this paper, we present collision attacks for 4 and 5 pass HAVAL. For 4-pass HAVAL, we describe two practical attacks for finding 2-block collisi...