Merry Christmas 5
clayl...@comcast.net
patented. As a product of my imagination, I offer it free of charge as
a "public domain" entity, to be redistributed freely. Some may be
disappointed by the low value of this post. The next post on July 4,
2008 may be better. For convenience I have included the contents of
the random number generator seed specification from post #2....
1) Using the seed generator, produce an array of 256 shuffle tables,
each of which has 256 entries. Cycle through the tables as each one is
used to shuffle the bits of 32 byte blocks of source to produce 32
bytes of bit shuffled output. You could use other higher level tables
to determine the order in which the shuffle tables are cycled. If you
can tolerate a bloat factor of two or four or higher, then you could
produce 32 bytes of output from 16 or 8 bytes of input, with the input
bits being supplemented by bits from a random number generator.
Furthermore there is no reason why the inputs to the procedure should
be passed through in clear. You could have a supplementary random
number table of size 64k which specifies whether the bits are normal
or inverted....
2) When it is more important for data to be secure rather than
available for decoding (such as archives), then the coded preliminary
output should be split into two or more files which are recorded on
WORM media and physically separated to prevent unauthorized access. If
you lose one of the pieces, then you are out of luck. Like a jigsaw
puzzle, you must have good records of the procedure used to split the
coded preliminary output into pieces.....
3) A bit encoding procedure which is relatively secure was outlined in
a post of July 31 2007 where I described using Bayesian correlation to
determine whether a 8 bit value represented a zero, one or noise. The
relevant discussion is given below, with the proviso that it is from
1983 and describes a hardware implementation.
In 1983 while working at Boeing/BMAC in Huntsville AL, I provided them
with a secure encryption technique for communications equipment after
overhearing a conversation regarding problems in a classified
communications project. It can be best summarized by the following :
a) Amplitude modulate the transmitter's signal by using ADC/
Multiplier/ DAC components before entering the final amplifier stages.
Read the receiver description below to deduce how modulation is
performed.
b) In the receiver a block of 8 phase locked ADC devices are used to
sample the incoming signal and produce a block of 8 eight bit digital
values. Each bit of the transmitted signal is processed by a different
ADC in the block. The digital value of each bit is used to determine
whether the transmitted value represents a zero, a one, or random
noise used to confuse interceptors of the signal.
c) The block of digital values is processed using flash multipliers
with each value being multiplied by an 8 bit correlation coefficient
to produce a 16 bit value. This value is tested against a flash lookup
table of Bayesian thresholds to determine which of the three
possibilities the bit represents.The correlation coefficients vary
often, with lookup tables determining the current values for each
block of 8 bytes representing 8 bits of received signal.
d) The lookup tables are pulled from fast memory and reloaded into
each multiplier as each encryption code becomes obsolete. How often
this occurs is determined by additional tables which control the
addresses of the lookup tables. Memory speed is a primary determinant
of the practical channel frequency. The speed of the ADC and
multipliers is next most important, though that may have changed as
memory devices have become quite fast in the past 24 years....
e) The fast memory tables are generated at communications device
startup by processing an (agreed upon between users) encryption code
key. Table algorithms such as random number generators vary widely,
so
I offered no suggestions on that point.
f) The lookup table entry being used to decrypt the comm signal is
changed frequently based upon random number lookup tables which are
also generated by encryption keys. The table structure may be multi-
tiered to vary based upon time or upon number of processed data
blocks, to give two obvious methods.
--------------------------------------------------------------------------
From "Merry Christmas 2"
I hereby declare that this specification is not copyrighted or
patented. As a product of my imagination, I offer it free of charge as
a "public domain" entity, to be redistributed freely. So copy this
post to your websites anytime you please. Develop front end processes
for password usage from it if you so desire, because there are no
license fees involved.
This is a specification for converting an ASCII password string into
a larger byte string which can be used to initialize an array of
random number seeds. A neural net is the basis for the concepts given.
A "node" is the data processing and state vector component of the
system. A "nexus" is the derived set of links for each node. For each
node there are up to 26 active links in its nexus. The network
occupies a three dimensional cube with sides of length six. In the two
dimensional example given, node 01 is the network input node and node
18 is the network output node. Node 01 links to nodes 02, 03, and 04.
Node 05 links to nodes 02, 03, 04, 06, 07, 10, 11, and 12 etc.
++++++++++++++++++ 01 ++++++++++++++++++
++++++++++++++ 04 = 02 = 03 ++++++++++++++
++++++++++ 09 = 06 = 05 = 07 = 08 ++++++++++
++++++++++ 14 = 11 = 10 = 12 = 13 ++++++++++
++++++++++++++ 17 = 15 = 16 ++++++++++++++
++++++++++++++++++ 18 ++++++++++++++++++
The password string is a series of byte values which are used to
initialize the net. Each byte is converted to a set of coordinates
within the net for placement of the next node. This is done by taking
the remainder after division (by six) of the byte value for the "x"
coordinate (value 0-5). Then division of the byte value by thirty six
is used to obtain the "y" coordinate (value 0-5) from the remainder.
The "z" coordinate is the value obtained from division by thirty six
of the byte value. Once all nodes have been selected from the seeding
password string, the nodes are linked as an initial nexus network to
their nearest neighbors in the x,y, and z coordinates. The 64 bit
state vector of each used node is initialized (going from 0,0,0
towards 5,5,5) to the eight bytes of the password string beginning at
the first byte and wrapping around (when necessary) from the last back
to the first. So as an example, if the password string is 11
characters, the first node found gets the bytes 0-7 in its state
vector, the fifth node found gets bytes 4-10 then 0... Once all
initialization nodes have the state vector initialized, the password
string is submitted to the net eight bytes at a time at the node
closest to 0,0,0 (wrapping around when necessary). Each of the nodes'
inputs 64 bits are xored with the node's state vector to produce a new
state vector, and the node's output value is the bitwise "not" of the
final result after all inputs are processed. Inputs come from the
closest neighbors in x,y,z coordinates which have a lower coordinate
value, while outputs are clocked to the closest neighbors in x,y,z
coordinates which have a higher coordinate value. So information
propagates from 0,0,0 towards 5,5,5.
The neural net nexus is rewired to have new nodes based upon the final
output node's value. As the net evolves, the input and output nodes
are revised to pick the closest nodes to 0,0,0 and 5,5,5. For each
clock cycle the eight byte output node result is converted byte by
byte into eight new nodes' x,y,z coordinates as specified above (/6
then /36). If the net already contains a node at the specified
coordinates, no action is taken. Otherwise the new node gets its state
vector initialized to the current value of the output node shifted
circularly right by a distance depending upon which byte is currently
being processed. The nexus of the new node is connected up to nearest
neighbors and those neighbors are revised to access the new node in
addition to the existing links. When TBD cycles pass without a new
node being added, this phase of filling in the network ends. Then the
latest output node is connected to the input, and each clock cycle of
the net produces a 64 bit number to be used as a random number seed.
Alternatively, a second (larger) neural net can be built from the
outputs of the current net, relatively disengaging dependency upon the
original password string to form a new neural net for use in
generating random number seeds.
----------------------------------------------------------------------------------
Composing this document required one hour of work - another trivial
example of what I have conceived over the years. Don't clap, throw
money! I need $20000 before July 1 2008 to pay off debts. When I am
worrying about debts, I am inhibited from thinking about ways to help
total strangers....
Send checks to 3395 Harrell Road, Arlington TN 38002-4261.
Signed By :
Lonnie Courtney Clay Laughing Crazy Coot TARZAN Chic Logo Guy