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

[Warik]

bitches!

-------------------

K#>*.+}'+++5K"> +!p2!*,+S,>S3>\-f

------------------

Hints:

1) No, the original string is not a random arrangement of characters. It's a grammatically correct sentence using real-live English words.

2) No, it's not a one-way encryption.

3) The encrypted string above is 1.5 times longer than the original.

4) There is a space between 5K"> and +!p in case you did not notice.

Have fun or something.

-Warik

 

[Bongo_from_Congo]

What's this:
$_='while(read+STDIN,$_,2048){$a=29;$b=73;$c=142;$t=255;@t=map{$_%16or$t^=$c^=( $m=(11,10,116,100,11,122,20,100)[$_/16%8])&110;$t^=(72,@z=(64,72,$a^=12*($_%16 -2?0:$m&17)),$b^=$_%64?12:0,@z)[$_%8]}(16..271);if((@a=unx"C*",$_)[20]&48){$h =5;$_=unxb24,join"",@b=map{xB8,unxb8,chr($_^$a[--$h+84])}@ARGV;s/...$/1$&/;$ d=unxV,xb25,$_;$e=256|(ord$b[4])<<9|ord$b[3];$d=$d8^($f=$t&($d12^$d4^ $d^$d/8))<<17,$e=$e8^($t&($g=($q=$e14&7^$e)^$q*8^$q<<6))<<9,$_=$t[$_]^ (($h=8)+=$f+(~$g&$t))for@a[128..$#a]}print+x"C*",@a}';s/x/pack+/g;eval

 

[Warik]

Looks like a bunch of Perl code to me.

-Warik

 

[Bongo_from_Congo]

 

[freshr1]

Looks like a bunch of Perl code to me.

-Warik

Perl programmer should be executed. Actually Larry Wall should be executed. Whoever wrote that code must have some awesome job security, lol.

Warik, your answer lies here :

http://www.geekcode.com/geek.html

 

[Fonz]

bitches!

-------------------

K#>*.+}'+++5K"> +!p2!*,+S,>S3>\-f

------------------

Hints:

1) No, the original string is not a random arrangement of characters. It's a grammatically correct sentence using real-live English words.

2) No, it's not a one-way encryption.

3) The encrypted string above is 1.5 times longer than the original.

4) There is a space between 5K"> and +!p in case you did not notice.

Have fun or something.

-Warik

Warik, you should now by now that on-time pad ciphers are
un-breakeable.

Fonz

 

[Warik]

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

on-time pad ciphers are un-breakeable.

I dunno what an on-time pad cipher is, though. =)

-Warik

 

[HappyScrappy]

if it is 1.5 times longer, then some chars are substituted with multiple - meaning A could map to +< or watever.

if you don't know the method, it is always harder the shorter the message is.

meaning if your message were two pages long, and as fonz says - not a one time pad, then it would be easy to break in a matter of minutes if feasible.
but with the short message, it makes it far harder to run any analysis on b/c statistically speaking you can't prove anything.

 

[HappyScrappy]

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

I dunno what an on-time pad cipher is, though. =)

-Warik

which means you are that much more likely to have written one

 

[HappyScrappy]

a one time pad is a random arrangement of characters, and then you map the message to those chars.
then to decrypt it you need that exact pad.

there is no math, no algorithm, and you use it once.

if you use it multiple times, then it helps expose how to break it. hence the one-time pad. (got the pad part form war times, they used to have a notepad of one-time keys - and it was a big deal to steal those notebooks)