Prev: What is the next Prime that is 3 mod 4 from this one?
Next: AES CTR Mode
From: claylonnie on 1 Sep 2008 11:01
This specification is not copyrighted or patented. I intend it to be
public domain for free distribution. The data encryption technique is
useful for small data streams, with significant bloat.
If you are unfamiliar with the signal processing concepts of auto and
cross correlation, then you should read up on them. This specification
uses them and the notion of Bayesian thresholds.
Consider an n-byte signed data sequence. Its autocorrelation is one.
Its cross correlation with the byte sequence formed by taking the twos
complement of each byte is minus one. The magnitude "m" of the un-
normalized summation of products depends upon the amplitude of the
bytes in the reference sequence and the amplitude of the bytes in the
correlation data stream. If the Bayesian threshold ratio is set to 0.5
then one half "m" correlates to the reference stream, while minus one
half "m" correlates to the complement of the reference stream. Any
correlation data stream which falls between those two sums correlates
to neither. So a byte stream of the same length as the reference
stream can be classed as either a zero, a one, or noise passed through
to confuse interceptors.

1) Using the technique of "Merry Christmas 2" generate random number
seeds from a password string.
2) One set of random number seeds is used to generate string lengths.
The range of string lengths might vary from 5 to 15 or whatever is
specified by the user.
3) Another seed is used to generate signed byte sequences of length as
specified in 2).
4) Some source of random numbers is used to generate white noise which
is output.
5) Generate correlation (1) and anti- correlation (0) thresholds for
the number of bytes n specified in 2) from the byte sequence specified
in 3) above. The threshold depends upon the user specified ratio for
the Bayesian threshold.
6) Slice off n bytes of noise and generate the sum of products for
correlation and anti-correlation.
a) If the uncoded bit to process is a one and the noise correlates
then output the noise n bytes.
b) If the uncoded bit to process is a zero and the noise anti-
correlates then output the noise n bytes.
c) If both or neither case applies, then output the noise to garble
the data stream.
d) If the cases a) b) c) are not met, go back to 6.
7) If a user specified number of uncoded bits have been processed or
if a user specified number of case c) have occurred, then increment
the pointer to arrays 2) and 3) above.

As you can see the bloat is high, perhaps a factor of 100 to 1000.
Just for fun, encrypt "Alice in Wonderland" on your hard drive to
attract idiots hacking you and waste their time.

Preparing this document took one hour. I have received no gifts or any
other form of compensation for any of this "Merry Christmas" series.
If you have found the ideas to be useful, then please send a check to
me at 3395 Harrell Road, Arlington TN 38002-4261.

Lonnie Courtney Clay Laughing Crazy Coot TARZAN Chic Logo Guy

 | 
Pages: 1
Prev: What is the next Prime that is 3 mod 4 from this one?
Next: AES CTR Mode