Team C.O.B.R.A. Derrick Chiu Matthew Denker Kyle Morse Mark Srebro

Overview of Project  Secure Efficient Distance Vector Based Routing Destination Sequence Distance Vector  Game

Goals  Develop Algorithm  Research Improvements  Visualize

Improvements  Load Balancing Distribute routing tasks evenly through network Extend overall battery life of adhoc devices in network

Improvements  Hash Chain: R  H0  H1  H2  H3  …  Hn-2  Hn-1 R = random root n = chain length  Naïve approaches: Calculate chain up to element needed Store entire chain

Improvements  Our approach: Store only key elements from chain Find nearest key element and use to calculate needed element  6k element chain, every 60th: Memory:  60x less Hash operations, average:  3000 vs. 27

Improvements

Metrics  The Grand Equation

Hash Algorithms  MD5  SHA-160/256/384  RIPEMD-128/160  Tiger  Whirlpool  HAVAL-256-3/4/5

Improvements

Metric Equation results:  Original Value:  New Efficient Value (RIPEMD-128):  New Secure Value (SHA-256):  % Efficient Improvement:  % Secure Improvement:

Goals met?  A resounding yes  Seven hashing algorithms tested  Visualization/game demo later  Improvements Hashing Network Load

Lessons Learned  Planning is like money: you can never have enough.  Communication is more of the same.  Setting numerous short term goals is more effective than numerous long term goals.

Changes  Add Advanced Visualization More tests (Load Balancing) Support for Generics  Remove Unnecessary Hash Algorithms Testing Code (for actual release)

The Future  Further hashing improvements  Implementing more demonstrations  Honing metric to include general improvements

Demo!