•January 4, 2008 • 1 Comment
Ok, small update!
I think I got the problem fixed with the repeating Iterations, but this puts me in front of another problem. I now need to generate some kind of key from my only two starting points for the encryption. This key has to be unique to my starting values I have for the Iterations. What I’ll do is it’ll generate the key which will be the starting points for the iterations for each letter. Then It will Iterate from there that way u won’t be able to almost read the letters from the cyphered code….
Well that’s all for today!
Cya soon! Gonna go skiing tomorrow so probably not many update tomorrow!
•January 4, 2008 • Leave a Comment
Woah here comes an update on the dev of FETA!
Alot has been done! I’ve changed the complete Algorithm structure from working with mysql tables to arrays.
At the same time I’ve already implemented a simple encryption for a Text… and it’s working pretty good!
Now but something I’ve encountered and I’m having a problem is the decryption or well let’s say malicious decryption.
What I found out is… If you have your alphabet with 26 letters on the top in the form of Iterations So we have:
A B C D E F G and so on
Then the Iterations will Just be wandering.
If u have an A first then the next A after the first will have the iteration of B. I think that’s a bit of a problem because even If I encode the 3 Letters CBA they will all have the same Iteration but that also tells me hey these three letters are next to each other.
It gives me a bit of a headache….
Hmm well I’m working on it…
•January 3, 2008 • Leave a Comment
Well here’s another round of Feta 😀
Some of the Problems I ran to was a rounding problem in Java. Because the values I got from the Iterations quickly exceeded the available Variable area and numbers were just getting too big, I have to work with rounded values. I searched for a couple different ways to solve the problem and only found one that really works but only till 5 digits behind the comma. I want to find a possibility to make it possible with more than 5 digits because it would make the code more secure, and the repeating numbers wouldn’t occur that often.
Another thing I decided to do was to work with a database in the background rather than using huge arrays. Just so you can imagine, the code right now produces to let’s say encrpyt a text with 310000 characters about 81 million Iterations of our function. The calculation takes about 3 minutes right now. Which I think is ok.
So what’s next… I’m working on a program that implements the Idea of FETA. But I’m going to make it OpenSource and probably release it under the Creative Commons Licencse because I want it to be accesible to everyone that also wants to share with everyone. Well that’s pretty much everything for now. Keep in touch. Maybe next time I can already show you some encrypted stuff! 😀