We examine the relationship between running time and error of parallel sorting algorithms. This is done by applying Hastad's main lemma to relate the size depth and error of simple circuits, that sort an input of 0's and 1's. As a consequence, we obtain lower bounds for approximate counting as well.

We consider the class of linear precoded (LP) orthogonal frequency division multiplexing (OFDM) systems. We first show that single-carrier zero-padded transmissions, termed ZP-only, can be viewed as a special case of LP-OFDM. By resorting to the pair-wise error probability analysis, we establish the optimality of ZP-only among the LP-OFDM class in terms of its performance in random frequency-se...

This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a compl...

MD5 is an older algorithm (1992) devised by Rivest. We present an overview of it here. It generates a 128-bit message digest from an input message of any length. It is built from a basic block function g : 128-bit× 512-bit→ 128-bit. The MD5 hash function h is obtained as follows: First the original message is padded to length a multiple of 512. The result m is split into a sequence of 512-bit b...

Conventional, straight keyboards remain the most popular design among keyboards sold and used with personal computers despite the biomechanical benefits offered by alternative keyboard designs. Some typists indicate that the daunting medical device-like appearance of these alternative 'ergonomic' keyboards is the reason for not purchasing an alternative keyboard design. The purpose of this rese...

UltraWideband (UWB) systems use Multi-Band OFDM (MB-OFDM) techniques for transmission. UWB based systems are power limited by the regulation of Federal Communications Commission (FCC). CP introduces correlation in the transmitted data sequence and hence introduces ripples in the power spectral density (PSD) of the transmitted data. This in turn reduces the range of data transmission. The overla...

In this work, we revisit the security analysis of AES-128 instantiated hash modes. We use biclique cryptanalysis technique as our basis for the attack. The traditional biclique approach used for key recovery in AES (and preimage search in AES based compression function) cannot be applied directly to hash function settings due to restrictions imposed on message input due to padding. Under this c...

The prevention of fractures amongst older people consists of (i) prevention and treatment of osteoporosis, (ii) prevention of falling and (iii) prevention of fractures using injury-site protection. As the great majority of hip fractures are caused by a sideways fall with direct impact on the greater trochanter of the proximal femur, one approach to prevention is the use of an adequately configu...

This paper presents a new signature forgery strategy. The attack is a sophisticated variant of Desmedt-Odlyzko’s method [11] where the attacker obtains the signatures of m1, . . . , mτ−1 and exhibits the signature of an mτ which was never submitted to the signer; we assume that all messages are padded by a redundancy function μ before being signed. Before interacting with the signer, the attack...

We present a second preimage attack on SHAMATA-512, which is a hash function of 512bit output and one of the first round candidates of the SHA-3 competition. The attack uses differential paths that hold with a probability one and a meet-in-the-middle approach to find second preimages. The time complexity is about 2 computation of the step function and the memory complexity is about 2 blocks of ...