Let's have an encryption CHALLENGE!

[BinarySHOCK]

Here's something i come up with... when i wasn't sober....


DECLARE FUNCTION Rotate$ (Text$)
DECLARE FUNCTION Cipher$ (Text$, Key$)

CLS

NormalString$ = "I Can't Goto Sleep The Clowns Will Eat Me"
Key$ = "QbAsIcNeWs..."

CipherdText$ = Cipher$(NormalString$, Key$)
DeCipherd$ = Cipher$(CipherdText$, Key$)

PRINT "Orignal- "; NormalString$
PRINT "Cipherd- "; CipherdText$
PRINT "DeCipherd-> "; DeCipherd$

PRINT STRING$(80, "-")

PRINT "Orginal Len-"; LEN(NormalString$)
PRINT "Cipherd Len-"; LEN(CipherdText$)
PRINT "DeCipherd Len->"; LEN(DeCipherd$)

SYSTEM

DEFINT A-Z
FUNCTION Cipher$ (Text$, Key$)

DIM L AS LONG
DIM D AS LONG
DIM X AS LONG

X& = 1

OldKey$ = Key$

FOR I = 1 TO LEN(Text$)

Key.I = Key.I + 1
IF Key.I > LEN(Key$) THEN Key.I = 1

C = (ASC(MID$(Text$, I, 1)) XOR (ASC(MID$(Key$, Key.I, 1)) * I)) AND 255
Enc$ = Enc$ + CHR$©

L = L + 7
D = D + 4
X = ((X + (SQR((X XOR (D MOD X))) * (64 + (L * D) - I))) AND 4095) XOR I

IF X Mod (L + D) < I THEN Key$ = Rotate$(Key$)

NEXT

Key$ = OldKey$

Cipher$ = Enc$

END FUNCTION

FUNCTION Rotate$ (Text$)

N$ = SPACE$(LEN(Text$))

FOR I = 2 TO LEN(Text$)

MID$(N$, I - 1) = MID$(Text$, I, 1)

NEXT

MID$(N$, LEN(N$)) = MID$(Text$, 1, 1)

Rotate$ = N$

END FUNCTION