This paper discusses provable security of two types of cascade encryptions. The first construction CE, called l-cascade encryption, is obtained by sequentially composing l blockcipher calls with independent keys. The security of CE has been a longstanding open problem until Gaži and Maurer [9] proved its security up to 2κ+min{ n 2 ,κ} query complexity for large cascading length, where κ and n d...

MIBS is a 32-round lightweight block cipher with 64-bit block size and two different key sizes, namely 64-bit and 80-bit keys. Bay et al. provided the first impossible differential, differential and linear cryptanalyses of MIBS. Their best attack was a linear attack on the 18-round MIBS-80. In this paper, we significantly improve their attack by discovering more approximations and mounting Herm...

Intense combinatorial study of balanced incomplete block designs since the time of Fisher and Yates has led to a great many designs with the same numbers of treatments, blocks, and block size. While the basic analysis does not differentiate among different BIBDs with the same parameters, they do differ in their capacity to withstand loss of experimental material. Competing BIBDs are compared he...

Constructions of balanced sampling plans excluding contiguous units, a class of designs introduced by Hedayat, Rao and Stufken, are given which provide a complete solution to this problem when k = 4.

Abstract T emory designs with replication numbers all or all but one of the values in the range 1\(V-1J/(K-l} to 1\(V-l)/(K-2) are studied. It is known that for K=3 and replication numbers all values in the range 1\{V-l) /(K-l J to 1\(V-l }/(K-2J, designs exist if and only if 1\=2. Here we show the uniqueness of such designs. When K=3 and all values in the range 1\(V-l J/(K-l) to 1\(V-l )/(K-2)...

In 2001, the United Kingdom Engineering and Physical Sciences Research Council awarded three of the authors of this paper a grant for “A Web-based resource for design theory”. As the project developed, we have had to face a number of problems, ranging from fundamental questions such as “What is a design?”, through research topics such as “How should the concept of partial balance be extended to...

In this paper, we use the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence of...

This article present a application of Block Korkin---Zolotarev lattice reduction method for Lattice Reduction---Aided decoding under MIMO---channel. We give a upper bound estimate on the lattice reduced by block Korkin---Zolotarev method (BKZ) for different value of the block size and detecting by SIC.

There are well known necessary conditions for the existence of a generalized Bhaskar Rao design over a group G, with block size k = 3. We prove that they are sufficient for nilpotent groups G of even order, and in particular for 2-groups. In addition, we prove that they are sufficient for semi-dihedral groups.

Let X[0..n− 1] and Y [0..m− 1] be two sorted arrays, and define the m × n matrix A by A[j][i] = X[i] + Y [j]. Frederickson and Johnson [7] gave an efficient algorithm for selecting the kth smallest element from A. We show how to make this algorithm IO-efficient. Our cache-oblivious algorithm performs O((m + n)/B) IOs, where B is the block size of memory transfers.