Kickstarter

I have always had an interest in subtleties. Five years ago I had an euphonious moment about an encryption based on the movement of a chess piece the knight. I thought it was very interesting: The Knight can move on any countless number of squares to infinity. This will be true as long as its path remain closed. I then set out to devise how to make this work. First to encrypt anything you will need an engine (excipher) then the variables. The engine is represented by the squares and the variables are the input(alphabets) on the squares. I solved many solutions of the Knight's tour and I know the algorithm needed to move an alphabet two squares up or down and one square sideways. The movement can be interchanged as one square up or down and two squares sideways.

This helped my first intuitive knowledge of using the method for encryption. I then decided to work on the fundamental element of the spoken and written English language. I thought that working on the alphabetic level would be easier. I figured out that all the solutions of the Knight's tour are members of a family or set. I chose a 32 unit-square grid for simplicity. The aim is to transpose and substitute the alphabets. In turn we will map them to the message we want to send. First the message will be identified as a plaintext. Once you lock the plaintext with a chosen key or phrase you will derive the ciphertext. The ciphertext is the end result of encryption.

Only the intended user can now decrypt and read the message. The intended user will have the original key passed on to him or her. By so doing no one else can read the message. The symmetric nature of this system makes the whole process possible. The encryption becomes stronger as you increase the size of the grid and the more variables are repeated.

Our work now will be to solve all the possible solution of the Knigh's tour. It will be a lot of work to harvest all these solutions. Our intent is to use the solutions for encryption. You can contribute solutions as you see fit. We are working to make this an open source system for all to use. Many other features could be added as we grow from the initial development.

In the simplest and most primitive form we present to you a ciphertext.
Note that during encryption you subtract 32 from sum of the key and the message that add up to more than 32.-Ciphertext. When decrypting data you add 32 to those ciphertext that add up to less than 32. From the value you get you will remove the key from: Just subtract the value of the key.-Voila your original message.

Try this ciphertext by following the picture presented closely.
qcui fueq gfjs
ASCII to HEX:
%71%63%75%69%20%66%75%65%71%20%67%66%6A%73
UNICODE:
qcui fueq gfjs

You can get back to the plaintext by following the picture on top this section. The plaintext is the message for the ciphertext written here. Let us know what you think. We will be open to any ideas. We hope to gain much support from our backers.