Sciweavers

1508 search results - page 168 / 302
» Efficient Path Profiling
Sort
View
JCST
2007
97views more  JCST 2007»
14 years 11 months ago
Improved Collision Attack on Hash Function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
Jie Liang, Xue-Jia Lai
TON
2008
99views more  TON 2008»
14 years 11 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
VLSISP
2008
145views more  VLSISP 2008»
14 years 11 months ago
Area, Delay, and Power Characteristics of Standard-Cell Implementations of the AES S-Box
Cryptographic substitution boxes (S-boxes) are an integral part of modern block ciphers like the Advanced Encryption Standard (AES). There exists a rich literature devoted to the ...
Stefan Tillich, Martin Feldhofer, Thomas Popp, Joh...
COMCOM
2004
117views more  COMCOM 2004»
14 years 11 months ago
Dynamic bandwidth allocation in multi-class connection-oriented networks
Multi-class network is becoming a more attractive solution to provide Quality-of-Service guarantee, as more quality-demanding applications are emerging. This research considers ne...
Samer Taha, Mohsen Kavehrad
IWCMC
2010
ACM
14 years 9 months ago
High performance modified DSR routing protocol for WLAN mesh networks
This work presents a cross-layer modification to the DSR protocol which discovers high throughput paths on multi-hop wireless mesh networks. The modified DSR incorporates a metric...
Mustafa Ramadhan, Mark Davis