Here is my publish for thy encryption KME1.
This is a detailed document explaining the algorithm for the encryption and decryption of digital data. This document uses the ANSI C Standard for the C language to explain the algorithm where not explained by english. If you have any relavent messages such as but not limited to questions and comments; you may send them by internet mail to the address "
[email protected]". You may also send relavent messages via the United States Post Office to:
"Leonard Kevin McGuire Jr.
366 East Skipper Road
Eclectic, Alabama 36024"
The encryption process is done in blocks. Each plain text block is one forth the size of the encrypted block, and one eighth the size of the key block. There may be one to ~ key blocks. Each plain text block is applied with the key block of current key block index, then the key block index is advanced. The key block index will be repeated from the beginning once it reaches the end. This causes the key blocks to roll like a circular chain over the plain text blocks producing the encrypted blocks.
This is the process of a text block applied to a key block. Let A and B be a thrity-two bit value. Let X be a eight bit value. Let E be a thrity-two bit value.
E = ((X + A) * (X + A)) + B
At random events one or more fake encrypted blocks will be inserted using the current key block index for all in sequence for this event.
W != Q
E = ((W + A) * (Q + A0)) + B
The decryption process is the reverse of the encryption except: All encrypted blocks must:
P = sqrt(E - B)
And, P must have no fractional part. If P has a fractional part the block must be ignored, and the current key block index must not be incremented.
.
