Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:20 ADT
Chuck McManis (cmcmanis@freegate.com)
Fri, 27 Mar 1998 00:57:35 -0800
Hi Julian, perhaps I wasn't clear, let me try again.
You've got a chaffed stream, in this stream you have chaff packets with
serial numbers and messages. Lets say for the example it is
1, A, mac
1, B, mac
1, C, mac
2, B, mac
2, A, mac
2, C, mac
3, A, mac
3, C, mac
3, B, mac
4, B, mac
4, C, mac
4, A, mac
The number of possible messages from this sequence is:
Seq 1 2 3 4
A B A B
B B A B
C B A B
A A A B
B A A B
...
C C B A
The total being something like 3! * 4! or 144 combinations. Now if we've
futher 'packaged' the message (per Ron's suggestion) then the correct
message should be extractable (it is a package) automatically.
Relatively easily. (further the problem is seems easily vectored)
Further since the message is actually in the clear, one might be able to
use correlation techniques to winnow the solutions and avoid the larger
factorial combinations.
To use your example, one constructs all possible necklaces and then
notes that one is all red and one is all green. Unlike encryptions which
are compute bound, this problem is merely memory bound.
That's why I was wondering about its effectiveness, especially in
networks where there are natural choke points where one can capture all
of the information in the transaction.
--Chuck
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:20 ADT