Vermans cipher Extension?

[Blizna]

I think many people here know about the Vermans cipher-its one which is quite easy and is theoretically made good thats its "unbreakable"-when the key is as long as the message and when is used only once.

The principle is quite simple:
Each letter is moved by a specific number of positions in the alphabet, also the key is a row of numbers.

ABC, coded with key 2,1,3 is C,C,F.

The proof of "ubreakability" is based on the logical result, that if you use random key, you change letters to random ones so there isnt any relation to the original message. (google)

I think it wont be possible to do in MMF2 without any extension..but maybe this would be very interesting one <img src="/center/images/graemlins/smile.gif" alt="" />

[neat_Kliker2]

hah, its called byte changing and the file encryption object in MMF 1.5 could do it, even a lille' kid could crack it

[Blizna]

Yes its also the XOR function.

Its to break when you use specific key, but impossible when you set random key which is only known for you and the other person.

[Matt]

No useful encryption is unbreakable. Basically, if you can decrypt data, so can someone else.

[Blizna]

I only posted what I have found-its unbreakable if you dont have the key since the key is used once and is fully random. SOmething like XOR encryption. I was only intersted in this stuff

[neat_Kliker2]

If the encryption is unbreakable, I will tell you now that you are breaking the law.
And if it makes ye happy, http://clickteam.com/center/showflat.php/Cat/0/Number/10686/an/0/page/0#Post10686

[Blizna]

Just find out yourself that with RANDOM key and if ONCE used and as logn as the message is...there is no way (also, maybe after years of attempting) how to break it.

Its not my idea man, so calm down..Its mathematical proof for this /something about dependency of two random events, dont know the word in english/.

You should learn about this more. The encryption itself is easy to break, but try it as any encyklopedia says-with random key, use it once and for each letter...

[amnesiasoft]

ever heard of something called a brute force attack? sure it would take a while, but it can be done.

[Blizna]

Yes..if the computer would recognize that the words (sentence) make a sense...

[Matt]

I'm a bit interested in this. How does the key get transmitted? If it's random and only used once, how does the recipient know the key to do the decryption?