Sciweavers

849 search results - page 36 / 170
» Completely Non-malleable Schemes
Sort
View
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
ISCAS
2007
IEEE
92views Hardware» more  ISCAS 2007»
15 years 4 months ago
Macroblock-Level Adaptive Scan Scheme for Discrete Cosine Transform Coefficients
—Discrete Cosine Transform (DCT) has been widely used in image/video coding systems, where zigzag scan is usually employed for DCT coefficient organization. However, due to local...
Li Zhang, Wen Gao, Qiang Wang, Debin Zhao
EMSOFT
2007
Springer
15 years 3 months ago
Buffer optimization and dispatching scheme for embedded systems with behavioral transparency
Software components are modular and can enable post-deployment update, but their high overhead in runtime and memory is prohibitive for many embedded systems. This paper proposes ...
Jiwon Hahn, Pai H. Chou
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
15 years 3 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 9 months ago
On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes
In the classical compress-and-forward relay scheme developed by (Cover and El Gamal, 1979), the decoding process operates in a successive way: the destination first decodes the co...
Xiugang Wu, Liang-Liang Xie