In this paper we propose a new family of very efficient hardware oriented block ciphers. The family contains six block ciphers divided into two flavors. All block ciphers share the 80-bit key size and security level. The first flavor, KATAN, is composed of three block ciphers, with 32, 48, or 64-bit block size. The second flavor, KTANTAN, contains the other three ciphers with the same block siz...

PAGES is block cipher family based on the design of Speck, see [1]. However, some intriguing design details of Speck were not used in the design of PAGES. PAGES has block size of 256 bit and comes in three version: PAGES-512, PAGES-768, and PAGES-1024, were the number denotes the key length. The number of rounds is 64, 96, or 128, respectively. PAGES uses variables of 128 bit, that is half the ...

The cipher CTC (Courtois Toy Cipher) described in [4] has been designed to demonstrate that it is possible to break on a PC a block cipher with good diffusion and very small number of known (or chosen) plaintexts. It has however never been designed to withstand all known attacks on block ciphers and Dunkelman and Keller have shown [13] that a few bits of the key can be recovered by Linear Crypt...

PAGES is block cipher family based on the design of Speck, see [1]. However, some intriguing design details of Speck were not used in the design of PAGES. PAGES has block size of 256 bit and comes in three version: PAGES-512, PAGES-768, and PAGES-1024, were the number denotes the key length. The number of rounds is 64, 96, or 128, respectively. PAGES uses variables of 128 bit, that is half the ...

We propose a novel methodology to design Block Cipher functions. This methodology is illustrated with the design of a specific block cipher function Maya. Our design philosophy is to derive the SBoxes themselves from the secret key. This makes breaking any round function equivalent to guessing all the key-bits. Advantages of our design include much larger key sizes in relation to the block size...

Explicit clustering in a statistical indoor propagation model is found to have significant effects on the capacity of an array-to-array link or matrix channel. Effects of antenna spacing, Poisson homogeneity, block size, and transmit power allocation strategies are also considered.

Let (W, C) be an m-cycle system of order n and let Ω ⊂ W , |Ω| = v < n. We say that a handcuffed design (Ω,P) of order v and block size s (2 ≤ s ≤ m−1) is contained in (W, C) if for every p ∈ P there is an m-cycle c = (a1, a2, . . . , am) ∈ C such that: (1) p = [ak, ak+1, . . . , ak+s−1] for some k ∈ {1, 2, . . . ,m} (i.e. the (s− 1)-path p occurs in the m-cycle c); and (2) ak−1, ak+s ∈ Ω. Note...

If the blocks of a G DD(X,G,A) with block size 4, index 3 and type gu can be arranged into a (gu)/4 × (gu) array, such that: (1) the main diagonal consists of u empty subarrays of size g/4× g; (2) the blocks in each column form a partition of X\G for some G ∈ G, while the blocks in each row contains every element of X\G 3 times and no element of G for some G ∈ G, then the design is called a fra...