yo im making my own (stream) encryption algorithm which is basically
for 0<=x<=length of text to be encrypted
text character(x) is xored by every pass character in turn
text character(x) is xored by the length of the entire password
text character(x) is xored by 1 pass character which rotates (i.e. the x th pass character mod the length of the password)
my problem is: if the password is longer than the text, the order of the excess of the password does not matter i.e.
the incorrect pass: 12876543 will sucessfully decrypt the ciphertext :(
plz list ANY ideaz coz i really need to have this finished REALLY soon