This document outlines a method for encoding, storing, and transmitting a file to one or more recipients securely by creating multiple bit streams that essentially contain no viable content, but by which the recipient can re-construct the original content.
This is achieved by using a symmetric operation to decompose a “high value” byte sequence (such as a file containing confidential data) in to blocks of random bit strings, and using hash “label” values to retrieve known bit blocks in order to reconstruct the original high-value byte sequence, based on instructions and label values contained in a “blueprint” string sequence.
- A symmetric bitwise operation, such as XOR or EQV can be used to split a high-value bit sequence in to two random sequences that can be recombined in to the original sequence
- A hash function can be used to generate hash “label” values for a given bit sequence, that can be used as an index for storing and retrieving a specific bit sequence.
- Salt Data can be used to generate multiple, unique hash values for the same bit sequence, and can be used to generate multiple, unique index functions.
- A blueprint string containing hash values and assembly instructions can be used to locate, download, transform, and assemble various blocks of random bit strings in order to reconstruct the original high-value bit sequence.
- Using overlapping hash indices, multiple equivalent blueprints can be constructed that represent the same original bit sequence. This allows mutation and randomization when sharing blueprints.
Current version: Draft v0.9.2