More on Unscrambling Address Lines

Abstract

A writer stores some data in memory accessible via address lines. If an adversary permutes the address lines after the writer leaves the message, then how can a reader find the permutation? This is the so-called unscrambling address lines problem [1]. By generalizing the previous approach of Broder et al. [1], we give and analyze a new algorithm, which is parallelizable. We also consider an alternative version of the problem by assuming that the writer have the ability to write at the correct address without the effect of adversary. In this case, we give a very simple algorithm to identify the permutation.