Problem Statement

Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z to A). So key 2 encrypts "HI" to "JK", but key 20 encrypts "HI" to "BC". This simple "mono-alphabetic substitution cipher" provides almost no security, because an attacker who has the encoded message can either use frequency analysis to guess the key, or just try all 25 keys. Caesar cipher is identical to Vigenère cipher with a key of length 1. Also, Rot-13 is identical to Caesar cipher with key 13.

Let's start with the solution:

set letters="ABCDEFGHIJKLMNOPQRSTUVWXYZ"::split();

func caesar(text,shift:number=1){
	set res:string="";
	for(i=0;?text-1;1){
		set t=text::at(i);
		set n=(letters::find(t::upper())+shift)%?letters;
		while(n<0){
			n=?letters+n;
		}
		set l=letters[n];
		(t::upper()==t)|=>l=l::lower()
		res+=l;
	}
	send res;
}

func decode(text,shift:number=1){
	set res:string="";
	for(i=0;?text-1;1){
		set t=text::at(i);
		set n=(letters::find(t::upper())-shift)%?letters;
		while(n<0){
			n=?letters+n;
		}
		set l=letters[n];
		(t::upper()==t)|=>l=l::lower()
		res+=l;
	}
	send res;
}

set e=caesar("Hi",20);
set d=decode(e,20);

log(e);
log(d);