Request Comments: Transpose/XOR Hash

[Olcay Cirit <olcay@libtech.com>]

-----BEGIN PGP SIGNED MESSAGE-----

Hi!

I'm working on a cipher that utilizes Cipher Block Chaining
and One-way hashing to create a sequence of pseudo-random
numbers to XOR against a plaintext.

I'd like to know if anyone has comments regarding the hash
method I came up with. It is a combination of Transposition
and XORing. Basically, it works like this:

Let's say K is the 8 character key that will be hashed. 
There are two binary accumulators M and L, which store the
Most and Least significant bits in each byte of K. After M and
L are both 8 bits long, they are XORed together and the 
resulting value replaces byte N in the Key. This is repeated
8 times, and each time, N is incremented by one.

	Any thoughts, comments?

		-olcay

- --
"For he who lives more lives than one, |) Olcay Cirit -- olcay@libtech.com
   more deaths than one must die"      (| http://www.libtech.com/olo2.html

- ---
[This message has been signed by an auto-signing service.  A valid signature
means only that it has been received at the address corresponding to the
signature and forwarded.]

-----BEGIN PGP SIGNATURE-----
Version: 2.6.2
Comment: Gratis auto-signing service

iQBFAwUBMTpumyoZzwIn1bdtAQHnqAGA2CzuLVpiPdRQ84MuC8aBxy7vcIZsujLr
85hGcVoknfAujjXFoy7KOxGQrZt3RorK
=jQ7w
-----END PGP SIGNATURE-----