| From: | Adam Bell |
| Date: | 2 Aug 2000 at 12:30:23 |
| Subject: | Programming encryption (poss OT) |
Hi,
I apologise if this is too off topic.
Anyway, a bit ago I was discussing methods of writing encryption
algorithms. I wanted to try one of the simple solutions suggested,
but had forgotten one of the parts of it from the procedure below:
If you wanted to encrypt the word AMIGA, first you would convert each
letter to its binary form. A random binary number is then generated
and that number is then applied with a boolean operation against the
binary value of the first letter creating a new binary number, which
is converted back to Alpha form and stored in a file. The key for
that number is then also converted to Alpha and stored next to that
letter in the file.
The process repeats until all of the characters are completed which
should end up with a file 10 characters long corresponding to the
letters in the word AMIGA and their associated keys.
The part I have forgotten is the boolean operation section. It must
work so that the same boolean operation can be used to convert the
coded letter back to its original form. As far as I can remember,
the binary value of the letter to be coded is NOT'd first and then
another operation such as AND OR or XOR etc is then applied.
Any help, and sorry if too OT.
Ad
Quote carefully and read all ADMIN:README mails