(no title)
vgb2k11 | 8 years ago
Each contact has an identical table of data (pure-random, 1 terabyte, ASCII 256 or choose your own encoding); this is your "Key of some sort". Messages sent between contacts are encoded character-by-character as offsets from the start of the table. No offset can be used more than once. After offset 1099511627776 (for a 1 terabyte files) has been used for encode, a new key file is generated and exchanged.
Example:
tables contains a terabyte of random data such as "ahx Ui D 7gu3a7NrdMr 9y&S )iM AAt 8'9s 98m..e kj j uhbd f..."
1,5,6,9,12,15,18,20,23,25,30,33,35,36,39,41 = hi garry it's me
y7|8 years ago
vgb2k11|8 years ago
MatthewWilkes|8 years ago
The short form of the problem is where you say "No offset can be used more than once." where you actually want "No offset can be used unless it is higher than all previously used offsets".
Consider an assassin and their controller using this scheme for designating targets. Garry is first, the controller sends
The security services intercept this and notice that garry is killed.They now know that 0-9 != g, 11-12 != a, 14-15 != r, 17-18 != r, 19-21 != y
They suspect that either andi or rory is the next target, the controller orders Andy killed and sends:
The security services can then infer that the person to be killed is matched by the regex: andi matches, rory doesn't.It's much better to treat your random characters as numbers to add to the your data mod 256 (in your ASCII 256 example), and also set rules like fixed message length and scheduled messages that can be 'no-op'.