LBlock is a lightweight block cipher proposed in ACNS 2011. It has 64-bit block size and 80-bit key size which is the typical parameter setting accpeted by most of the recent proposed lightweight block ciphers. It has fast hardware implementation efficiency and it still remains rather secure considering the recent results and the security margin it provides. In this paper, we investigate the di...

In cryptanalysis of block ciphers, there are several attacks that are always feasible and for which the success probability and complexity only depend on key length and/or block size. Exhaustive key search and table precomputation are two of such attacks. In Hel80] an attack was introduced which provides a tradeoo between the processing complexity of exhaustive key search and the memory complex...

We propose a new block cipher LEA, which has 128-bit block size and 128, 192, or 256-bit key size. It provides a high-speed software encryption on general-purpose processors. Our experiments show that LEA is faster than AES on Intel, AMD, ARM, and ColdFire platforms. LEA can be also implemented to have tiny code size. Its hardware implementation has a competitive throughput per area. It is secu...

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)...