Article View: sci.crypt
Article #3968Flat distributions
From: stuart
Date: Wed, 20 Jan 1988 23:47
Date: Wed, 20 Jan 1988 23:47
15 lines
1113 bytes
1113 bytes
I am somewhat surprised that no-one has mentioned it (perhaps I
missed a relevant article or two) but one standard technique for
fooling traffic analysis (an element of cryptology but not
cryptography) is to insert enciphered "dummy" messages into the
traffic. On continuous data streams this can be taken to the limit
of sending traffic constantly whether you have "real" traffic or not.
A moment's reflection will show you that this technique would be
without value if a dummy message could be distinguised from a real
message in the enciphered traffic. (Note that on continuous streams
you are not going to go to very much trouble to produce dummy messages
with the same characteristics as real messages; you'll just send bits
and exploit the superiority of your cipher.)
Stu Friedberg {ames,cmcl2,rutgers}!rochester!stuart stuart@cs.rochester.edu
Technical Details
Message-ID:
<6048@sol.ARPA>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!bbn!rochester!daemonShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!bbn!rochester!daemon From: stuart@cs.rochester.edu Newsgroups: sci.crypt Subject: Flat distributions Message-ID: <6048@sol.ARPA> Date: 20 Jan 88 23:47:27 GMT Sender: daemon@cs.rochester.edu Lines: 15