Back during the Carter Administration, when Iranian radicals were about to overrun the U.S. Embassy, American intelligence officers inside the compound were feverishly shredding sensitive documents in their “vault.” Apparently, they succeeded–or at least thought they had–until news reports months later revealed that the radicals had meticulously reassembled many of the shredded documents to learn the classified secrets therein.
It seems there would be a mathematical means of speeding up the reassembly of shredded documents. For instance, could one code the printed lines of shredded text (from top to bottom in terms of relative position on the shredded paper) and then use a computer to cross-match everything and thereby reassemble it much faster? (After all, when you straight-cut shred a document, the word fragments are kept in order relative to their position on the page.)
Sorry if I did not explain this well, but I’m hoping you get my drift. ALSO, let’s ignore shredded documents that are cut in a criss-cross pattern and instead focus on the conventional (1970s-era) method of straight-cut shredding.
thanks.