HappyScrappy... Code... whomever - decrypt this =)

[KINGKONG69]

What the fuck are you nerds talking about?!?!
--

LOL

 

[Warik]

damn - then I'm out.

haha.

this sounds surprisingly like the code that Code posted (enigma simplified) - but his is more complex underneath - this one I just need to sit down with (since it is known that it is english underneath, and you claim it isn't a one time pad...).

Well I'm almost done writing the crypter/decrypter in PHP. Taking a while cause PHP is whining about maximum execution time exceeded... sigh must write it in Java now.

-Warik

 

[HappyScrappy]

Well I'm almost done writing the crypter/decrypter in PHP. Taking a while cause PHP is whining about maximum execution time exceeded... sigh must write it in Java now.

-Warik

must be all that simple math.

if it helps to make it shorter - a page or two would likely still work

 

[Code]

Looks ike regular substitution but with a one to many mapping schema.

If this is true, then so is the following:
First, it is indeed a one-time pad methodology.
Second, the message is not large enough notice statistics.

My guess is that this is a normal substitution ring, but it must roll or simply defy a stastically typical English sentence.

I have one rolling ring that comes up with this.....



K#> = H
*.+ = E
}'+ = L
++5 = L
K"> = O


+!p = W
2!* = O
,+S = R
,>S = L
3>\ = D
-f = .

 

[Warik]

K#> = H
*.+ = E
}'+ = L
++5 = L
K"> = O


+!p = W
2!* = O
,+S = R
,>S = L
3>\ = D
-f = .

Wrong. =)

I'll post a longer (very long) message later or tomorrow. Got kind of tied up a few min ago.

-Warik

 

[Island Son]

Converted 2-digit Ascii chars to 3-digit octal, then converted the pairs back to ascii? Might need to subtract some standard number from all of them. That would explain the 1.5 and the "grade school addition" comment. I don't have the patience to try coding this tonight.

so, based on Code's comment and the originality of your usual posts my wild guess is WARIK RULEZ!