Security

Unkeyed Jam Resistance 300 Times Faster: The Inchworm Hash

Free registration required

Executive Summary

An important problem is achieving jam resistance in omnidirectional radio communication without any shared secret or shared key. The only known algorithm that solves this problem is the BBC (Baird, Bahn, Collins) concurrent code. However, BBC requires the choice of a hash function. The choice of hash determines both the speed and security of BBC. Cryptographic hashes such as the standard SHA-1 hash are not well suited for this application. The authors propose the Inchworm hash, a new algorithm specifically designed for use in BBC.

  • Format: PDF
  • Size: 350 KB