Sciweavers

506 search results - page 89 / 102
» The Block Cipher Square
Sort
View
IACR
2011
85views more  IACR 2011»
12 years 9 months ago
Some Instant- and Practical-Time Related-Key Attacks on KTANTAN32/48/64
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...
Martin Ågren
ICPP
1990
IEEE
14 years 1 months ago
Reducing Memory and Traffic Requirements for Scalable Directory-Based Cache Coherence Schemes
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...
Anoop Gupta, Wolf-Dietrich Weber, Todd C. Mowry
CP
2008
Springer
13 years 11 months ago
Search Strategies for Rectangle Packing
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...
Helmut Simonis, Barry O'Sullivan
GLOBECOM
2007
IEEE
14 years 4 months ago
Overlapped Alamouti Codes
—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...
Yue Shang, Xiang-Gen Xia
CORR
2007
Springer
84views Education» more  CORR 2007»
13 years 9 months ago
MMSE Optimal Algebraic Space-Time Codes
—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...
G. Susinder Rajan, B. Sundar Rajan