506 search results - page 89 / 102 » The Block Cipher Square |
106
click to vote
IACR
2011
14 years 3 months ago
2011
The hardware-attractive block cipher family KTANTAN was studied by Bogdanov and Rechberger who identified flaws in the key schedule and gave a meet-in-the-middle attack. We revis...
123
click to vote
ICPP
1990
IEEE
15 years 7 months ago
1990
IEEE
As multiprocessors are scaled beyond single bus systems, there is renewed interest in directory-based cache coherence schemes. These schemes rely on a directory to keep track of a...
140
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
86
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—In most of the existing space–time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensiv...
121
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...