We prove that Tandem-DM, one of the two “classical” schemes for turning a blockcipher of 2n-bit key into a double block length hash function, has birthday-type collision resist...
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
In this paper we first present a uniformity property that characterises optimal channel assignments for networks arranged as cellular or square grids. Then, we present optimal ch...
Madhusudana V. S. Shashanka, Amrita Pati, Anil M. ...
A new, practical, and efficient approach is proposed for 3D vascular segmentation and bifurcation structure extraction. The method uses a combination of mathematical morphology, re...
Yoshitaka Masutani, Thomas Schiemann, Karl Heinz H...
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...