نتایج جستجو برای: block size decision

تعداد نتایج: 1031019  

2015
Dieter Schmidt

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

2008
Mahadevan Gomathisankaran Ruby B. Lee

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

Journal: :Discrete Mathematics 2004

Journal: :Discrete Mathematics 1989

2009
Chen Chen Ning Han Chunlian Yao Yuan Li

The new generation video coding standard H.264/AVC has been developed to achieve higher coding efficiency than previous video coding standards. Its variable block size motion compensation requires huge computation, which is a big problem for real time application. To reduce the complexity, we propose a fast inter mode decision algorithm with early mode prediction rules and early block size clas...

Journal: :IEEE Trans. Communications 2002
Kuo-Hui Li Mary Ann Ingram Anh Van Nguyen

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.

1999
Salvatore Milici Gaetano Quattrocchi

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

Journal: :Graphs and Combinatorics 2014
Xiuwen Ma Zihong Tian

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

Journal: :Discrete Mathematics 1996
Donald L. Kreher Gordon F. Royle Walter D. Wallis

A regular graph design RGD(v; k; r) is a design on v points with blocks of size k and constant replication number r, such that any two points belong to either 1 or 1 +1 common blocks, for some constant 1. We investigate resolvable regular graph designs with block size 4. In particular we determine the spectrum of such designs for v 16.

1998
M. Seefeldt

A four-component reaction kinetics for the densities of mobile and non-excess sessile dislocations and of mobile and immobile disclinations is proposed to describe the mi-crostructure development under plastic deformation up to large strains. The densities of non-excess sessile dislocations and of immobile disclinations are connected to ow stress contributions. For the dislocation contribution,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید