Projects Update

•May 29, 2009 • Leave a Comment

Ok I’ve been pretty busy in the meantime!

First of all, I’ve been working alot with linux lately, and alot of mac aswell, and the obligatory windows, for gaming purposes. 😀
I just wanna do a short summary of the projects I’ve been working on lately.

The newest project I’ve done was trying to get the Interceptor to work on a WRT54G, a common Wireless router.
The Interceptor is a tool made by Robin Wood (check out his page at which sniffes packets over a network and encrypts them and sends them via wireless network and vpn to your pc or laptop or whatever.
A great tool that can be used for many purposes!
Originally it was made for the Fon though. I’ll keep you updated on the progress I’m making in compiling it for the Linksys Router.

A second project I’m now working on is getting the Midi Protocol to work over Ethernet. I know there are some tools outthere but most of them cost money or are hard to understand.

Which brings me to my third project which is making more music with my synthesizers and getting my 24″ iMac running Logic Studio to work. My old Audio Interface Card MAudio Firewire 410 killed the firewireport on my macbook and on the brand new iMac. That Sucks. Yeah. So off to repair it is! But shall be back until monday.
Then I can finally fire up my Saffire Pro Audio Interface for absolute Music Making Mayhem!!!

Muaha ^_^

So I’ll keep yall updated!


Development Forgery v0.2

•January 29, 2009 • Leave a Comment

Here’s an update on my current developments.

I’ve been working on making the encryption more effective and reducing the memory being used by the program, just debuging and all that stuff. So for what I have now is a version 0.2 of Forgery that has come away from the use of Array’s and using ArrayLists’s instead for better upscaling especially for the new feature in this version.

The new version features multiple encryption and saving to an external file.
When using the multiple encryption feature the program get’s extremely hardware hungry.
The encryption of the phrase “lol!” takes about 5 minutes needs 1gig of ram for the heap space and the outputted phrase is over 200 thousand lines long!! It’s a 10.4 mb text file.

Sadly I have found an error in my algorithm. Which means…. The encrypted text CANNOT be decypherd. I don’t know how I could have overlooked this, because it’s a really simple mistake. Well currently I’m thinking of what I could do with the algorithm and the program anyway.

And the best Idea is to turn the whole thing into a Memory Tester. But we’ll see what happens.

So much for now!

Stay tuned for more!

Release: Forgery v0.1

•December 25, 2008 • Leave a Comment


Here’s the release of my program Forgery!
The version is 0.1.
It currently includes only the part of the program to encrypt, in forgery speak, to forge, the cleartext.
You can import the directory in the zip file to your eclipse or run the files from command line.

The use of the program is pretty much self explanatory.

If you find any bugs or have any wishes or comments let me know!

Well then have fun with Forgery and I’ll keep you updated on the development!
Download Link: Download here
Lukas Mosser


•December 23, 2008 • Leave a Comment

Ok, so last time I wrote a post I was still working on FETA. Well since I stopped working on FETA because of my limited knowledge in trying to write the code in java and some brainstorming on it’s usability, I ‘ve been writing some other programs.

A Portfolio program, a ceasar chiffre, and as I wrote the ceasar chiffre I got into the Encryption stuff again.

What I came up with was Forgery.

What it does is, it’s actually not a encryption program with everyone having his own key but there is an algorithm that serves all.
The goal was not to make a damn hard to break cypher but something that hides the clear text.

It’s some real quick code and I’m currently working in the decyphering part and the menu. So wrapping it all, ready to ship. I will release this code this time.

Ok to explain how Forgery works:
Step1: The cleartext is turned into a ascii, then into binary value.
Step2: The binary string is then split up into 2 bit piecelets.
Step3: The 2-bit pieces are split up in 3-bit pieces.
Step4: Now the real Algorithm starts working.

3 of these 3-bit pieces (a,b,c) are taken and then 3 calculations are made(results are d,e,f).

d = a+b-c
e = a+c-b
f = b+c-a

The three results (3-bit) are squared so negative numbers come up.

Step4: Put all pieces together again. Split up into 7 bit pieces and turn back to ascii and cleartext.

The results are completley different.
Interesting is that the use of capital and lower case letters changes the result completley.

Ok that’s all for now. I’ll release some code these days!


small Update

•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!

Mysql?…..out Arrays?…In! :D

•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…

Getting down to business

•January 3, 2008 • Leave a Comment

Well here’s another round of Feta 😀
Spent a couple of hours yesterday on getting my ideas into a design piece. After having finished I started doing some coding. The Language I chose to use is Java, because it’s the only one I can code in except for php html and javascript, which would all be unsuitable for this project.

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! 😀