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

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

1998
Johan Borst Bart Preneel Joos Vandewalle

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

Journal: :Human heredity 2009
Steven Buyske Guang Yang Tara C Matise Derek Gordon

Phenotype misclassification in genetic studies can decrease the power to detect association between a disease locus and a marker locus. To date, studies of misclassification have focused primarily on case-control designs. The purpose of this work is to quantify the effects of phenotype misclassification on the transmission disequilibrium test (TDT) applied to affected child trios, where both pa...

2013
Deukjo Hong Jung-Keun Lee Dong-Chan Kim Daesung Kwon Kwon Ho Ryu Donggeon Lee

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

Journal: :ILAR journal 2002
Ralph B Dell Steve Holleran Rajasekhar Ramakrishnan

Scientists who use animals in research must justify the number of animals to be used, and committees that review proposals to use animals in research must review this justification to ensure the appropriateness of the number of animals to be used. This article discusses when the number of animals to be used can best be estimated from previous experience and when a simple power and sample size c...

2014
Asli Bay Jialin Huang Serge Vaudenay

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

2010
Ingeborg van der Tweel

2014
K MuralIDharaN

One of the questions most frequently asked of a statistician is: how big should the sample be? Managers are anxious to obtain an answer to this fundamental question during the planning phase of the survey since it impacts directly on operational considerations such as the number of interviewers required. There is no magical solution and no perfect recipe for determining sample size. It is rathe...

Journal: :Journal of Information Processing 2016

2006
J. P. Morgan Valentin Parvu

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

Journal: :Australasian J. Combinatorics 1999
Charles J. Colbourn Alan C. H. Ling

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.

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

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